Editing apparatus and editing method

ABSTRACT

An editing apparatus and method for dividing or combining a data file(s) that is segmented into blocks of a predetermined data length and recorded in a non-volatile memory. An attribute file having a predetermined length is modified so as to reflect such dividing or combining. Such attribute file is recorded in the non-volatile memory.

BACKGROUND OF THE INVENTION

The present invention relates to an editing apparatus and method forperforming an editing process such as a divide process, or a combineprocess, for a file(s) recorded in a memory card using a File AllocationTable (“FAT”).

Electrically Erasable Programmable Read-Only Memory (“EEPROM”) iselectrically rewritable memory that requires a relatively large physicalspace because each bit of memory storage is composed of two transistors.Thus, the integration of EEPROM is restricted. To address this problem,flash memory capable of storing one bit with one transistor using anall-bit-erase system was developed. Flash memory may become a successorof recording media such as magnetic disks and optical discs. Flashmemory may be used in memory cards that can be freely attached to anapparatus and detached therefrom. A digital audio recorder/player mayuse such a memory card instead of a Compact Disc™ (“CD”) or Mini Disc™(“MD”).

One file management system used for a personal computer is called theFile Allocation Table (“FAT”) system. In the FAT system, when aparticular file is defined, predetermined parameters are successivelyset to the file. Thus, the size of a file becomes variable. One file iscomposed of at least one management unit (sector, cluster, or the like).Data corresponding to the management unit is written to a table referredto as the FAT. In the FAT file system, a file structure can be easilyformed regardless of the physical characteristics of a recording medium.Thus, the FAT file system may be used for a magneto-optical disc, afloppy disk, or a hard disk. In addition, the FAT file system may beused for the above-mentioned memory card.

However, a CD from which audio data is reproduced does not employ theFAT system concept at all. In an MD, with which audio data can berecorded and reproduced, music programs are recorded and edited using anFAT modified system called Link-P. Thus, although low power CPUs, may beused to control such systems, data therefrom cannot be exchanged with apersonal computer. As a result, the MD system has been developed as anisolated Audio-Video (A/V) system.

The Link-P system used for MDs includes a Pointer for Defective Area(“P-DFA”), a Pointer for Empty slot area (“P-Empty”), a Pointer forFreely Area (“P-FRA”), and P-TNO1 . . . P-TNo255. The P-DFA representsthe top position of a slot that contains information of a defect on anMD. The P-Empty area represents the use state of a slot. The P-FRArepresents the top position of a slot used for managing a recordablearea. The P-TNo1, P-TNo2, . . . , P-TNo255 represent the start positionsof slots corresponding to individual music programs.

Next, with reference to FIGS. 42A to 42E, a process for successivelysearching recordable areas dispersed on a recording medium will bedescribed using the area P-FRA. The volume of the P-FRA is 03 h. In thiscase, slot 03 h (as shown in FIG. 42A) is accessed. The start addressand the end address recorded in slot 03 h represent the start addressand the end address of one part on a disc.

As shown in FIG. 42A, link information recorded in slot 03 h representsthat the next slot address is 18 h. Thus, slot 18 h (shown in FIG. 42B)is accessed. Link information recorded in slot 18 h represents that thenext slot address is 1Fh. Likewise, slot 1Fh (shown in FIG. 42C) isaccessed. As shown in FIG. 42D, corresponding to link information inslot 1Fh, slot 2Bh is accessed. As shown in FIG. 42E, corresponding tolink information in slot 2Bh, slot E3 h is accessed. In such a manner,link information is traced until a null (00 h) is detected as linkinformation. Thus, the addresses of recordable areas dispersed on an MDare successively recognized. Alternatively, by controlling an opticalpickup and successively accessing these addresses, recordable areasdispersed on the MD can be obtained. Likewise, by referencing the P-DFAor the P-TNoN, defective areas that are dispersed on the MD can besuccessfully accessed.

With the Link-P system used for MDs, an editing process, such as adivide process and a combine process, for a music program(s) can beeasily performed. Although music programs on an optical disc can beedited, files in a nonvolatile memory cannot. As with the editingprocess using the Link-P system, a divide process or a combine processfor a music program(s) can be performed by editing the FAT. However, ifthe FAT is destroyed, the editing process cannot be performed, and anedited file cannot be accessed. In particular, flash memory deteriorateseach time it is rewritten. To address this problem, data is recorded inflash memory in such a manner that it is not repeatedly recorded to thesame block. However, under this method, repeatedly editing stored datamay still cause defective blocks. Furthermore, if a block that is usedto manage the FAT information is destroyed, the editing process cannotbe performed and the edited file cannot be accessed.

OBJECTS OF THE INVENTION

An object of the present invention is to provide an editing apparatusand method for a nonvolatile memory for adding an attribute file to thebeginning of each data file and using the attribute files to manageparts of data files that are dispersed in the memory so that files inthe memory can be edited even if the FAT area is destroyed.

Other objects and advantages of the invention will in part be obviousand will in part be apparent from the specification and the drawings.

SUMMARY OF THE INVENTION

A first embodiment of the present invention is an editing apparatus forediting a data file recorded in a nonvolatile memory for segmenting asingle data file that is successively reproduced to blocks each having apredetermined data length, the nonvolatile memory having a data area forrecording each block along with an attribute file having a predeterminedlength and a management area for recording management data for managinga data file recorded in the data area, the editing apparatus comprisingan operating device for selecting two data files recorded in the dataarea so as to perform a combine process for the selected two data files,a separating device for separating an attribute file from a backwardside data file of the selected two data files, an editing device forediting the management data recorded in the management area so that thetwo data files are logically linked and an attribute file added to aforward side data file of the selected two data files, and a recordingdevice for recording the management data edited by the editing device tothe management area and the attribute file added to the forward sidedata file to the data area.

A second embodiment of the present invention is an editing apparatus forediting a data file recorded in a nonvolatile memory for segmenting asingle data file that is successively reproduced to blocks each having apredetermined data length, the nonvolatile memory having a data area forrecording each block along with an attribute file having a predeterminedlength and a management area for recording management data for managinga data file recorded in the data area, the editing apparatus comprisingan operating device for setting a divide point of a particular data filerecorded in the data area, an editing device for editing the addedattribute file and the management data corresponding to the divide pointof the data file set by the operating device, a generating device forgenerating an attribute file of the data file on the backward side ofthe divide point set by the operating device, and a recording device forrecording the management data edited by the editing device to themanagement area and the attribute file added to the forward side datafile to the data area.

The invention accordingly comprises the several steps and the relationof one or more of such steps with respect to each of the others, and theapparatus embodying features of construction, combination(s) of elementsand arrangement of parts that are adapted to effect such steps, all asexemplified in the following detailed disclosure, and the scope of theinvention will be indicated in the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the invention, reference is made tothe following description and accompanying drawings(s), in which:

FIG. 1 depicts the structure of a digital audio recorder/player using anonvolatile memory card in accordance with the present invention;

FIG. 2 depicts the internal structure of a digital signal processor inaccordance with the present invention;

FIG. 3 depicts the internal structure of a memory card in accordancewith the present invention;

FIG. 4 depicts the file management structure of a memory card as astorage medium in accordance with the present invention;

FIG. 5 depicts the physical structure of data in a flash memory of amemory card in accordance with the present invention;

FIG. 6 illustrates the data structure of a memory card in accordancewith the present invention;

FIG. 7 illustrates a hierarchy of the file structure in a memory card inaccordance with the present invention;

FIG. 8 depicts a data structure of a reproduction management filePBLIST.MSF that is a sub directory stored in a memory card in accordancewith the present invention;

FIG. 9 depicts the data structure of an ATRAC3 data file divided intoblocks of a predetermined unit length, and including an attribute headerin accordance with the present invention;

FIG. 10A depicts a file structure before two files are edited with acombining process in accordance with the present invention;

FIG. 10B depicts a file structure after two files are edited with acombining process in accordance with the present invention;

FIG. 10C depicts a file structure after one file is edited with adividing process in accordance with the present invention;

FIG. 11 depicts the overall data structure of a reproduction managementfile PBLIST in accordance with the present invention;

FIG. 12A depicts a detailed data structure of a header portion of thereproduction management file PBLIST in accordance with the presentinvention;

FIG. 12B depicts a detailed data structure of a main data portion of thereproduction management file PBLIST in accordance with the presentinvention;

FIG. 12C depicts a detailed data structure of an additional informationdata portion of the reproduction management file PBLIST in accordancewith the present invention;

FIGS. 13, 14, and 15 form a table listing key code values foridentifying the type of information stored in an additional informationdata portion in accordance with the present invention;

FIG. 16A depicts a data structure of additional information data inaccordance with the present invention;

FIG. 16B depicts a data structure in accordance with the presentinvention wherein the additional information data is an artist name;

FIG. 16C depicts a data structure in accordance with the presentinvention wherein the additional information data is a copyright code;

FIG. 16D depicts a data structure in accordance with the presentinvention wherein the additional information data is date/timeinformation;

FIG. 16E depicts a data structure in accordance with the presentinvention wherein the additional information data is a reproduction log;

FIG. 17 depicts a detailed data structure of an ATRAC3 data file inaccordance with the present invention;

FIG. 18 depicts a data structure of an upper portion of the attributeheader of an ATRAC3 data file in accordance with the present invention;

FIG. 19 depicts a data structure of a middle portion of the attributeheader of an ATRAC3 data file in accordance with the present invention;

FIG. 20 is a correlation table for correlating record modes, recordtime, and other information in accordance with the present invention;

FIG. 21 is a table showing copy control states in accordance with thepresent invention;

FIG. 22 depicts a data structure of a lower portion of the attributeheader that composes an ATRAC3 data file in accordance with the presentinvention;

FIG. 23 depicts a data structure of a header of a data block of anATRAC3 data file in accordance with the present invention;

FIGS. 24A to 24C are flowcharts for a recovering method according to thepresent invention for the case wherein a FAT area was destroyed;

FIG. 25 depicts a file structure in a memory card according to anembodiment of the present invention;

FIG. 26 illustrates the relationship between a track informationmanagement file TRKLIST.MSF and an ATRAC3 data file A3Dnnnnn.MSAaccording to an embodiment of the present invention;

FIG. 27 depicts a detailed data structure of the track informationmanagement file TRKLIST.MSF according to an embodiment of the presentinvention;

FIG. 28 depicts a detailed data structure of NAME1 for managing a nameaccording to an embodiment of the present invention;

FIG. 29 depicts a detailed data structure of NAME2 for managing a nameaccording to an embodiment of the present invention;

FIG. 30 depicts a detailed data structure of an ATRAC3 data fileA3Dnnnnn.MSA according to an embodiment of the present invention;

FIGS. 31 and 32 depict a detailed data structure of INFLIST.MSF thatrepresents additional information according to an embodiment of thepresent invention;

FIG. 33 is a flowchart for a recovering method according to anembodiment of the present invention for the case wherein a FAT area wasdestroyed.

FIG. 34 depicts a memory map for explaining data transitions in acombine process for combining particular files in the memory mapstructure (see FIG. 6) according to an embodiment of the presentinvention;

FIG. 35A depicts a memory map before two files are combined inaccordance with the present invention;

FIG. 35B depicts a memory map after two files are combined in accordancewith the present invention;

FIG. 36 is a flow chart for explaining the combine process according toan embodiment of the present invention;

FIG. 37 depicts a memory map for explaining data transitions in a divideprocess for dividing a particular program in the memory map structure(see FIG. 6) according to an embodiment of the present invention;

FIG. 38A depicts a memory map before a particular program is divided inaccordance with the present invention;

FIG. 38B depicts a memory map after a particular program is divided inaccordance with the present invention;

FIG. 39 is a flow chart for explaining the divide process according toan embodiment of the present invention;

FIG. 40 is a flow chart for explaining the combine process according toan embodiment of the present invention;

FIG. 41 is a flow chart for explaining the divide process according toan embodiment of the present invention;

FIG. 42A depicts a management method for one part of a U-TOC (User-Tableof Contents) for managing recordable areas dispersed on amagneto-optical disc;

FIG. 42B depicts a management method for a part combined correspondingto a part shown in FIG. 42A;

FIG. 42C depicts a management method for a part combined correspondingto a part shown in FIG. 42B;

FIG. 42D depicts a management method for a part combined correspondingto a part shown in FIG. 42C; and

FIG. 42E depicts a management method for a part combined correspondingto a part shown in FIG. 42D.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 is a block diagram showing the structure of a digital audiorecorder/player 1 according to a preferred embodiment of the presentinvention. Digital audio recorder/player 1 records and reproduces adigital audio signal using a detachable memory card 40. Recorder/player1 may be a part of an audio system along with an amplifying unit (notshown), speakers (not shown), a CD player (not shown), an MD recorder(not shown), a tuner (not shown), and so forth. However, it should benoted that the present invention may be applied to other types of audiorecorders/players. For instance, recorder/player 1 may be a portabledevice. In addition, the present invention may be applied to a set topbox that records digital audio data that is circulated via satellitedata communication, digital broadcast, or the Internet, etc. Moreover,the present invention may be applied to a system that records/reproducesmoving picture data and still picture data rather than audio data. Thesystem according to an embodiment of the present invention may alsorecord and reproduce additional information, such as picture and text,other than a digital audio signal.

As shown in FIG. 1, recorder/player 1 comprises an audio encoder/decoderintegrated circuit (“IC”) 10, a security IC 20, and a Digital SignalProcessor (“DSP”) 30. Each of these devices is, preferably, a one-chipIC. Recorder/player 1 also includes an interface to detachable memorycard 40. Memory card 40 is also, preferably, a one-chip IC comprisingflash memory (nonvolatile memory) (not shown), a memory control block(not shown), and a security block (not shown). The security blockincludes a Data Encryption Standard (“DES”) encrypting circuit.According to the preferred embodiment, recorder/player 1 may use amicrocomputer instead of DSP 30.

Audio encoder/decoder IC 10 has an audio interface 11 and anencoder/decoder block 12. Encoder/decoder block 12 encodes digital audiodata in accordance with a highly efficient encoding method and writesthe encoded data to memory card 40. In addition, encoder/decoder block12 decodes encoded data read from memory card 40. The highly efficientATRAC3 format encoding method, which is a modification of the AdaptiveTransform Acoustic Coding (“ATRAC”) format used for MDs, may be used.

In the ATRAC3 format, audio data sampled at 44.1 kHz and quantized with16 bits is encoded with high efficiency. In the ATRAC3 format, theminimum data unit of audio data for processing is a sound unit (“SU”).One SU contains data of 1024 samples (1024×16 bits×2 channels) that iscompressed to data of several hundred bytes. The duration of 1 SU isaround 23 msec. Under this highly efficient encoding method, the size ofcompressed data is around 10 times smaller than that of original data.As compared to the ATRAC1 format used in MDs, an audio signal compressedand decompressed according to the ATRAC3 format is less deteriorated inaudio quality.

Illustratively, a line input selector 13 selectively supplies areproduction output signal of an MD, an output signal of a tuner, or areproduction output signal of a tape to an Analog-to-Digital (“A/D”)converter 14. A/D converter 14 converts the input line signal to adigital audio signal (sampling frequency=44.1 kHz; the number ofquantizing bits=16). A digital input selector 16 selectively supplies adigital output signal of an MD, a CD, or a CS (Satellite DigitalBroadcast) to a digital input receiver 17. The digital input signal istransmitted through, for example, an optical cable. An output signal ofdigital input receiver 17 is supplied to a sampling rate converter 15.Sampling rate converter 15 converts the digital input signal into adigital audio signal (sampling frequency=44.1 kHz; the number ofquantizing bits=16).

Encoder/decoder block 12 of audio encoder/decoder IC 10 encodes theinput signal and supplies encoded data to a DES encrypting circuit 22through an interface 21 of security IC 20. DES encrypting circuit 22comprises a First-In-First-Out (“FIFO”) 23, and is disposed so as toprotect copyrights on content data. DES encrypting circuit 22 mayinclude a plurality of master keys (not shown), an apparatus-uniquestorage key (not shown), and a random number generating circuit. DESencrypting circuit 22 may also share an authenticating process and asession key with memory card 40, which, as described above, comprisesits own DES encrypting circuit (not shown). In addition, DES encryptingcircuit 22 may re-encrypt data using its storage key.

The encrypted audio data that is output from DES encrypting circuit 22is supplied to DSP 30. DSP 30 communicates with memory card 40 through abidirectional serial interface 25. In this illustrative embodiment,memory card 40 is attached to an attaching/detaching mechanism (notshown) of recorder/player 1. DSP 30 writes the encrypted data to flashmemory 42 of memory card 40. The encrypted data is serially transmittedbetween DSP 30 and memory card 40. In addition, an external StaticRandom Access Memory (“SRAM”) 31 is connected to DSP 30. SRAM 31provides recorder/player 1 with a sufficient storage capacity so as tocontrol memory card 40.

A bus interface 32 is connected to DSP 30. Data is supplied from anexternal controller (not shown) to DSP 30 through a bus 33 and businterface 32. The external controller controls all operations of theaudio system. The external controller supplies data such as a recordcommand or a reproduction command that is generated corresponding to auser's operation through an operation portion to DSP 30 through businterface 32. In addition, the external controller supplies additionalinformation such as image information and character information to DSP30 through bus interface 32. Bus 33 is a bidirectional communicationpath. Additional information that is read from memory card 40 issupplied to the external controller through DSP 30, bus interface 32,and bus 33. In reality, the external controller is disposed in, forexample, an amplifying unit of the audio system. In addition, theexternal controller causes a display portion to display additionalinformation, for example, the operation state of recorder/player 1, andso forth. The display portion is shared by the audio system. Since datathat is exchanged through bus 33 is not copyright protected data, it isnot encrypted.

The encrypted audio data that is read from memory card 40 by DSP 30 isdecrypted by security IC 20. Audio encoder/decoder IC 10 decodes theencoded data according to the ATRAC3 format. Output data of audioencoder/decoder 10 is supplied to a Digital-to-Analog (“D/A”) converter18. D/A converter 18 converts the output data of audio encoder/decoder10 into an analog signal. The analog audio signal is supplied to a lineoutput terminal 19.

The analog audio signal is supplied to an amplifying unit (not shown)through line output terminal 19. The analog audio signal is reproducedfrom a speaker or a head set. The external controller supplies a mutingsignal to D/A converter 18. When the muting signal represents a mute-onstate, the external controller prohibits the audio signal from beingoutputted from line output terminal 19.

FIG. 2 is a block diagram showing the internal structure of DSP 30.Referring to FIG. 2, DSP 30 comprises a core 34, a flash memory 35, anSRAM 36, a bus interface 37, a memory card interface 38, and inter-busbridges (collectively denoted 39). DSP 30 has the same function as amicrocomputer. Core 34 is equivalent to a CPU. Flash memory 35 stores aprogram that causes DSP 30 to perform predetermined processes. SRAM 36and external SRAM 31 are used as RAM for recorder/player 1.

DSP 30 controls a writing process for writing encrypted audio data andadditional information to memory card 40 corresponding to an operationsignal such as a record command received through bus interfaces 32 and37, and a reading process for reading same therefrom. In other words,DSP 30 is disposed between the application software side of the audiosystem, which records/reproduces audio data and additional information,and memory card 40. DSP 30 is operated when memory card 40 is accessed.In addition, DSP 30 is operated by software, such as a file system.

DSP 30 manages files stored in memory card 40 with the FAT system usedin personal computers. In addition to the file system, according to thepreferred embodiment of the present invention, a management file isused. The management file is used to manage data files stored in memorycard 40 and will be described in further detail below. The managementfile, as the first file management information, is used to manage audiodata files. On the other hand, the FAT, as the second file managementinformation, is used to manage all files including audio data files andmanagement files stored in the flash memory of memory card 40. Themanagement file is stored in memory card 40. The FAT is written to theflash memory along with the route directory and so forth before memorycard 40 is shipped to a user. The details of the FAT will be describedlater.

According to an embodiment of the present invention, in order to protectcopyrights on data, particularly audio data, such data that has beencompressed corresponding to the ATRAC3 format is encrypted. On the otherhand, since it is not necessary to protect any copyrights on themanagement file, the management file is not encrypted. There are twotypes of memory cards, an encryption type and a non-encryption type.However, a memory card for use with recorder/player 1 that recordscopyright protected data is limited to the encryption type.

Non-copyrighted voice and image data recorded by users are recorded onnon-encryption type memory cards.

FIG. 3 is a block diagram showing the internal structure of memory card40. Memory card 40 comprises a control block 41 and a flash memory 42that are structured as a one-chip IC. Bidirectional serial interface 25is disposed between DSP 30 of recorder/player 1 and memory card 40.Bidirectional serial interface 25 is composed of ten lines, that is, aclock line SCK for transmitting a clock signal that is transmitted alongwith data, a status line SBS for transmitting a status signal, a dataline DIO for transmitting data, an interrupt line INT, two GND lines,two INT lines, and two reserved lines.

The clock line SCK is used for transmitting a clock signal insynchronization with data. The status line SBS is used for transmittinga status signal that represents the status of memory card 40. The dataline DIO is used for inputting and outputting a command and encryptedaudio data. The interrupt line INT is used for transmitting an interruptsignal that causes memory card 40 to interrupt DSP 30 of recorder/player1. When memory card 40 is attached to recorder/player 1, it generatesthe interrupt signal. According to an embodiment, the interrupt signalis transmitted through the data line DIO, and the interrupt line INT isgrounded.

A serial/parallel converting, parallel/serial converting, and interfaceblock (“S/P, P/S, and I/F block”) 43 is an interface between DSP 30 ofrecorder/player 1 and control block 41 of memory card 40. S/P, P/S, andIF block 43 converts serial data received from DSP 30 of recorder/player1 into parallel data. In addition, S/P, P/S, and IF block 43 convertsparallel data of control block 41 into serial data and supplies theserial data to DSP 30. When S/P, P/S, and IF block 43 receives a commandand data through the data line DIO, it separates them into those thatare normally accessed to flash memory 42 and those that are encrypted.

In the format in which data is transmitted through the data line DIO,data is transmitted after a command is transmitted. S/P, P/S, and IFblock 43 detects the code of a command and determines whether thecommand and data are those that are normally accessed or those that areencrypted. Corresponding to the determined result, S/P, P/S, and IFblock 43 stores a command that is normally accessed to a commandregister 44 and stores data that is normally accessed to a page buffer45 and a write register 46. In association with write register 46,memory card 40 has an error correction code encoding circuit 47. Errorcorrection code encoding circuit 47 generates a redundant code that isan error correction code for data temporarily stored in page buffer 45.

Output data of command register 44, page buffer 45, write register 46,and error correction code encoding circuit 47 is supplied to a flashmemory interface and sequencer (“memory I/F and sequencer”) 51. MemoryIF and sequencer 51 is an interface coupled to flash memory 42 andcontrols data exchanged between flash memory 42 and control block 41.For example, data may be written to flash memory 42 through memory IFand sequencer 51.

Audio data that has been compressed corresponding to the ATRAC3 formatand written to flash memory 42 (hereinafter, this audio data is referredto as ATRAC3 data) is encrypted by security IC 20 of recorder/player 1and a security block 52 of memory card 40 so as to protect copyrights onthe ATRAC3 data. Security block 52 comprises a buffer memory 53, a DESencrypting circuit 54, a nonvolatile memory 55, and so forth.

Security block 52 of memory card 40 includes a plurality ofauthentication keys and a unique storage key assigned to memory card 40.Nonvolatile memory 55 stores a key necessary for encrypting data. Thekey stored in nonvolatile memory 55 cannot be analyzed. According to anembodiment, for example, a storage key is stored in nonvolatile memory55. Security block 52 also has a random number generating circuit (notshown). Security block 52 authenticates recorder/player 1 and shares asession key therewith. In addition, security block 52 re-encryptscontent data with the storage key through DES encrypting circuit 54.

For example, when memory card 40 is attached to recorder/player 1, theyare mutually authenticated. In other words, security IC 20 ofrecorder/player 1 and security block 52 of memory card 40 mutuallyauthenticate each other. When recorder/player 1 has authenticated memorycard 40 as an acceptable memory card and memory card 40 hasauthenticated recorder/player 1 as an acceptable recorder/player, theyare mutually authenticated. After the mutual authenticating process hasbeen successfully performed, recorder/player 1 and memory card 40generate respective session keys and share them with each other.Whenever recorder/player 1 and memory card 40 authenticate each other,they generate respective session keys.

When content data is to be written to memory card 40, recorder/player 1encrypts a contents key with a session key and supplies the encrypteddata to memory card 40. Memory card 40 decrypts the contents key withthe session key, re-encrypts the contents key with a storage key, andsupplies the encrypted contents key to recorder/player 1. The storagekey is a key unique to memory card 40. When recorder/player 1 receivesthe encrypted contents key, it performs a formatting process for theencrypted contents key, and writes the encrypted contents key and theencrypted content data to memory card 40.

In the above section, a writing process for memory card 40 wasdescribed. A reading process for memory card 40 will now be described.Data read from flash memory 42 is supplied to page buffer 45, a readregister 48, and an error correction circuit 49 through memory IF andsequencer 51. Error correction circuit 49 corrects an error(s) of thedata stored in page buffer 45. Output data of page buffer 45 that hasbeen error-corrected and the output data of read register 48 aresupplied to S/P, P/S, and IF block 43. The output data of S/P, P/S, andIF block 43 is supplied to DSP 30 of recorder/player 1 through serialinterface 25.

When data is read from memory card 40, the contents key encrypted withthe storage key and the contents encrypted with the block key are readfrom flash memory 42. Security block 52 decrypts the contents key withthe storage key. Security block 52 re-encrypts the decrypted contentskey with the session key and transmits the re-encrypted contents key torecorder/player 1. Recorder/player 1 decrypts the contents key with thereceived session key and generates a block key with the decryptedcontents key. Recorder/player 1 successively decrypts the encryptedATRAC3 data.

A CONFIG ROM 50 is a memory that stores partition information, varioustypes of attribute information, and so forth. Memory card 40 also has anerase protection switch 60. When switch 60 is in an erase protectionposition, memory card 40 is prohibited from erasing data stored in flashmemory 42 even if a command for causing memory card 40 to erase the datais supplied from recorder/player 1 to memory card 40. An oscillator, OSCCONT 61 generates a clock signal which may be utilized as a referencefor the timing of processes performed by memory card 40.

FIG. 4 is a schematic diagram showing the hierarchy of the file systemprocesses of a computer system that uses a memory card, e.g., memorycard 40, as a storage medium. As shown therein, the top hierarchicallevel is an application process layer. The application process layer isfollowed by a file management process layer, a logical addressmanagement layer, a physical address management layer, and a flashmemory access layer. In the above-mentioned hierarchical structure, thefile management process layer is the FAT file system. Physical addressesare assigned to individual blocks of flash memory 42 in memory card 40.The relationship between the blocks of flash memory 42 and the physicaladdresses thereof does not vary. Logical addresses are addresses thatare logically handled on the file management process layer.

FIG. 5 is a schematic diagram showing the physical structure of datahandled in flash memory 42 of memory card 40. In memory 42, a data unit(referred to as a segment) is divided into a predetermined number ofblocks (fixed length). One block is divided into a predetermined numberof pages (fixed length). In flash memory 42, data is erased one block ata time. Data is written to flash memory 42 or read therefrom one page ata time., The size of each block is the same. Likewise, the size of eachpage is the same. One block is composed of page 0 to page m. One blockmay have a storage capacity of 8 KB (kilobytes) or 16 KB and one pagemay have a storage capacity of 512 B (bytes). When one block has astorage capacity of 8 KB, the total storage capacity of flash memory 42is 4 MB (512 blocks) or 8 MB (1024 blocks). When one block has a storagecapacity of 16 KB, the total storage capacity of flash memory 42 is 16MB (1024 blocks), 32 MB (2048 blocks), or 64 MB (4096 blocks).

One page is composed of a data portion of 512 bytes and a redundantportion of 16 bytes. The first three bytes of the redundant portion isan overwrite portion that is rewritten whenever data is updated. Thefirst three bytes successively contain a block status area, a pagestatus area, and an update status area. The remaining 13 bytes of theredundant portion are fixed data that depends on the contents of thedata portion. The 13 bytes contain a management flag area (1 byte), alogical address area (2 bytes), a format reserve area (5 bytes), adispersion information Error-Correcting Code (“ECC”) area (2 bytes), anda data ECC area (3 bytes). The dispersion information ECC area containsredundant data for an error correction process for the management flagarea, the logical address area, and the format reserve area. The dataECC area contains redundant data for an error correction process for thedata in the 512-byte data portion.

The management flag area contains a system flag (1: user block, 0: bootblock), a conversion table flag (1: invalid, 0: table block), a copyprohibition flag (1: copy allowed, 0: copy not allowed), and an accesspermission flag (1: free, 0: read protect).

The first two blocks—blocks 0 and 1 are boot blocks. Block 1 is a backupof block 0. The boot blocks are top blocks that are valid in memory card40. When memory card 40 is attached to recorder/player 1, the bootblocks are accessed first. The remaining blocks are user blocks. Page 0of the boot block contains a header area, a system entry area, and aboot and attribute information area. Page 1 of the boot block contains aprohibited block data area. Page 2 of the boot block contains a CIS(Card Information Structure)/IDI (Identify Drive Information) area.

The header area of the boot block contains a boot block ID and a numberof effective entries. The system entries are the start position ofprohibited block data, the data size thereof, the data type thereof, thedata start position of the CIS/IDI area, the data size thereof, and thedata type thereof. The boot and attribute information contains memorycard type (read only type, rewritable type, or hybrid type), the blocksize, the number of blocks, the number of total:blocks, thesecurity/non-security type, the card fabrication data (date offabrication), and so forth.

Since flash memory 42 has a restriction for the number of times it canbe rewritten because of the deterioration of its insulation film, it isnecessary to prevent repeated access to only a particular storage area(block). Thus, when data at a particular logical address stored at aparticular physical address is to be rewritten, updated data of aparticular block is written to an unused block rather than the originalblock, where data it replaces is stored. Thus, after data is updated,the relation between the logical address and the physical addresschanges. This process is referred to as a swap process. Consequently,the same block is prevented from being overused for storing frequentlyaccessed data. Thus, the service life of flash memory 42 is prolonged.

The logical address is associated with data written to the block. Evenif the block for the original data is different from the block for theupdated data, the address on the FAT for the data does not change. Thus,the same data can be properly accessed. However, since the swap processis performed, a conversion table that correlates logical addresses andphysical addresses is required (this table is referred to aslogical-physical address conversion table). With reference to thelogical-physical address conversion table, a physical addresscorresponding to a logical address designated on the FAT is obtained.Thus, a block designated with a physical address can be accessed.

DSP 30 stores the logical-physical address conversion table in SRAM 31.When the available storage capacity of SRAM 31 is small, thelogical-physical address conversion table may be stored to flash memory42. The logical-physical address conversion table correlates logicaladdresses (2 bytes) sorted in ascending order with physical addresses (2bytes). Since the maximum storage capacity of flash memory 42 is 128 MB(8192 blocks), 8192 addresses can be assigned with two bytes. Thelogical-physical address conversion table is managed for each segment.Thus, the size of the logical-physical address conversion table isproportional to the storage capacity of flash memory 42. When thestorage capacity of flash memory 42 is: 8 MB (two segments), two pagesare used as the logical-physical address conversion table for each ofthe segments. When the conversion table is stored in flash memory 42, apredetermined one bit of the management flag area in the redundantportion in each page represents whether or not the current block is ablock containing the logical-physical address conversion table.

Memory card 40, as described above, may be used with the FAT file systemof a personal computer system as with a disc-shaped recording medium.Flash memory 42 has an IPL area, a FAT area, and a route directory area(not shown in FIG. 5). The IPL area contains the address of a program tobe initially loaded to the memory, e.g., SRAM 31, of recorder/player 1.In addition, the IPL area contains various types of memory information.The FAT area contains information with respect to blocks (clusters). TheFAT has defined unused blocks, next block number, defective blocks, andlast block number. The route directory area contains directory entriesthat are a file attribute, an update date [day, month, year], file size,and so forth.

Next, with reference to FIG. 6, a managing method using the FAT tablewill be described.

FIG. 6 is a schematic diagram showing a memory map. The top area of thememory map is a partition table portion. The partition table portion isfollowed by a blank area, a boot sector, a FAT area, a FAT backup area,a root directory area, a sub directory area, and a data area. On thememory map, logical addresses have been converted into physicaladdresses corresponding to the logical-physical address conversiontable.

The boot sector, the FAT area, the FAT backup area, the root directoryarea, the sub directory area, and the data area are collectivelyreferred to as the FAT partition area.

The partition table portion contains the start address and the endaddress of the FAT partition area.

Since the first track has only a partition table, there is a blank area.The boot sector contains the size of the FAT structure (12 bit FAT or 16bit FAT), the cluster size, and the size of each area. The FAT is usedto manage the position of a file recorded in the data area. The FAT copyarea is a FAT backup area. The route directory area contains file names,start cluster addresses thereof, and various attributes thereof. Theroute directory area uses 32 bytes per file.

The sub directory area is achieved by a directory attribute file as adirectory. In the illustrative embodiment shown in FIG. 6, the subdirectory area has four files named PBLIST.MSF, CAT.MSA, DOG.MSA, andMAN.MSA. The sub directory area is used to manage file names and recordpositions on the FAT. In other words, the slot of the file name CAT.MSAis assigned address “5” on the FAT. The slot of the file name DOG.MSA isassigned address “10” on the FAT. The top slot of the file name MAN.MSAis assigned address “110” on the FAT. An area after cluster 2 is a dataarea designated “Empty”. Audio data that has been compressedcorresponding to the ATRAC3 format is recorded. Audio data with the filename CAT.MSA is recorded to clusters 5 to 8. Audio data of DOG-1 as thefirst half of -the file with the file name DOG.MSA is recorded toclusters 10 to 12. Audio data DOG-2 as the second half of the file withthe file name DOG.MSA is recorded in clusters 100 and 101. Audio datawith the file name MAN.MSA is recorded in clusters 110 and 111.

An example of a single file being divided into two portions anddispersedly recorded will now be described. An area “Empty” in the dataarea is a recordable area. An area in and after cluster 200 is used formanaging file names. The file CAT.MSA is recorded to cluster 200. Thefile DOG.MSA is recorded to cluster 201. The file MAN.MSA is recorded tocluster 202. When the positions of the files are changed, the area inand after cluster 200 is re-arranged. When memory card 40 is attached,the beginning and the end of the FAT partition area are recorded withreference to the top partition table portion. After the boot sectorportion is reproduced, the root directory area and the sub directoryarea are reproduced. The slot of the reproduction management informationPBLIST.MSF in the sub directory area is detected. Thus, the address ofthe end portion of the slot of the file PBLIST.MSF is obtained. In theillustrative embodiment, since address “200” is recorded at the end ofthe file PBLIST.MSF, cluster 200 is referenced.

The area in and after cluster 200 is used for managing the reproductionorder of files. In the embodiment, the file CAT.MSA is the firstprogram. The file DOG.MSA is the second program. The file MAN.MSA is thethird program. After the area after cluster 200 is referenced, slots ofthe files CAT.MSA, DOG.MSA, and MAN.MSA are referenced. In FIG. 6, theend of the slot of the file CAT.MSA is assigned address “5”. The end ofthe slot of the file DOG.MSA is assigned address “10”. The end of theslot of the file MAN.MSA is assigned address “110”. When an entryaddress is searched on the FAT with address “5”, cluster address “6” isobtained. When an entry address is searched on the FAT with address “6”,cluster address “7” is obtained. When an entry address is searched onthe FAT with address “8”, code “FFF”, which represents the end, isobtained. Thus, the file CAT.MSA uses clusters 5, 6, 7, and 8. Withreference to clusters 5, 6, 7, and 8 in the data area, an area of ATRAC3data with the file name CAT.MSA can -be accessed.

Next, a method for searching the file DOG.MSA that has been dispersedlyrecorded will be described. The end of the slot of the file DOG.MSA isassigned address “10”. When an entry address on the FAT is searched withaddress “10”, cluster address “11” is obtained. When an entry address onthe FAT is searched with address “11”, cluster address “12” is obtained.When an entry address on the FAT is searched with address “12”, clusteraddress “101” is obtained. When entry address “101” is referenced, code“FFF” that represents the end is obtained. Thus, the file DOG.MSA usesclusters 10, 11, 12, 100, and 101. When clusters 10, 11, and 12 arereferenced, the first part of ATRAC3 data of the file DOG.MSF can beaccessed. When the clusters 100 and 101 are referenced, the second partof ATRAC3 data of the file DOG.MSF can be accessed. In addition, when anentry address is searched on the FAT with address “111”, cluster address“101” is obtained. When an entry address “111” is searched on the FAT,code “FFF”, which represents the end, is obtained. Thus, it is clearthat the file MAN.MSA uses clusters 110 and 111. As described above,data files dispersed in the flash memory can be linked and sequentiallyreproduced.

According to a preferred embodiment of the present invention, inaddition to the file management system defined in the format of memorycard 40, the management file may be used for managing tracks and partsof music files. The management file is recorded to a user block of flashmemory 42 of memory card 40. Thus, as will be described later, even ifthe FAT of memory card 40 is destroyed, a file can be recovered.

The management file is generated by DSP 30. When the power ofrecorder/player 1 is turned on, DSP 30 determines whether or not memorycard 40 is attached to recorder/player 1. When memory card 40 isattached, DSP 30 authenticates memory card 40. When DSP 30 hassuccessfully authenticated memory card 40, DSP 30 reads the boot blockof flash memory 42. Thus, DSP 30 reads the physical-logical addressconversion table and stores the read data to SRAM 31. The FAT and theroute directory have been written to flash memory 42 of memory card 40before memory card 40 is shipped to a user. When data is recorded tomemory card 40, the management file is generated.

In other words, a record command issued from a remote controller by auser or the like is supplied to DSP 30 from the external controllerthrough bus 33 and bus interface 32. Encoder/decoder IC 10 compressesthe received audio data and supplies the resultant ATRAC3 data tosecurity IC 20. Security IC 20 encrypts the ATRAC3 data. The encryptedATRAC3 data is recorded to flash memory 42 of memory card 40.Thereafter, the FAT and the management file are updated. Whenever a fileis updated (in reality, whenever the recording process of audio data iscompleted), the FAT and the management file stored in SRAMs 31 and 36are rewritten. As memory card 40 is detached or the power ofrecorder/player 1 is turned off, the FAT and the management file thatare finally supplied from SRAMs 31 and 36 are recorded to flash memory42. Alternatively, whenever the recording process of audio data iscompleted, the FAT and the management file written in flash memory 42may be rewritten. When audio data is edited, the contents of themanagement, file are updated.

In the data structure, additional information is contained in themanagement file. The additional information is updated and recorded toflash memory 42. In another data structure of the management file, anadditional information management file is generated besides the trackmanagement file. The additional information is supplied from theexternal controller to DSP 30 through bus 33 and bus interface 32. Theadditional information is recorded to flash memory 42 of memory card 40.Since the additional information is not supplied to security IC 20, itis not encrypted. As memory card 40 is detached from recorder/player 1or the power thereof is turned off, the additional information iswritten from SRAM 31 of DSP 30 to flash memory 42.

FIG. 7 is a diagram showing the file structure of memory card 40. Thefile structure includes a still picture directory, a moving picturedirectory, a voice directory, a control directory, and a music (HIFI)directory. Music programs may be recorded and reproduced. The musicdirectory may have two types of files. The first type is a reproductionmanagement file PBLIST.MSF (hereinafter, referred to as PBLIST). Theother type is an ATRAC3 data file A3Dnnnn.MSA that stores encryptedmusic data. The music directory may store up to 400 ATRAC3 data files(namely, 400 music programs). ATRAC3 data files are registered to thereproduction management file and generated by recorder/player 1.

FIGS. 8 and 9 show how a reproduction management file is used inimplementing ATRAC3. FIG. 8 shows the structure of a reproductionmanagement file. FIG. 9 shows the file structure of an ATRAC3 data file.An ATRAC3 data file is composed of an attribute header and an encryptedmusic data area for each music program. Both the reproduction managementfile and the ATRAC3 attribute header have a fixed file length of 16 KB(one block).

The reproduction management file shown in FIG. 8 is composed of aheader, a memory card name NM-1S (for one byte code), a memory card nameNM2-S (for two byte code), a program reproduction sequence table TRKTBLand an additional information area INF-S. The attribute header (shown inFIG. 9) at the beginning of the data file is composed of a header, aprogram name NM1 (for one byte code), a program name NM2 (for two bytecode), track information TRKINF (such as track key information), partinformation PRTINF, and an additional track information area INF. Theheader contains information on the total number of parts, the trackname, the size of the additional information area, and so forth.

The attribute header is followed by ATRAC3 music data. The music data isblock-segmented every 16 KB, each block starting with a header. Theheader contains an initial value for decrypting encrypted data. Only themusic data of an ATRAC3 data file is encrypted. Thus, the reproductionmanagement file, the header, and so forth are not encrypted.

Next, with reference to FIGS. 10A to 10C, the relation between musicprograms and ATRAC3 data files is described. One track is equivalent toone music program. In addition, one music program is composed of oneATRAC3 data (see FIG. 9). The ATRAC3 data file is recorded one clusterat a time into memory card 40. Each cluster has a capacity of 16 KB.Only one file is contained in each cluster. The minimum erasable unit ofdata for flash memory 42 is one block. A block is synonymous with acluster or a sector.

One music program (or track) is generally recorded in one part of atrack data file. However, when the program is edited, the music programmay be broken into a plurality of parts. The relationship between one ormore parts containing a single music program is managed with partinformation PRTINF stored in the attribute header of each music program(see FIG. 9). The part size is represented with part size PRTSIZE (4bytes) of the part information PRTINF. The first two bytes of the partsize PRTSIZE represents the number of total clusters in the currentpart. The next two bytes represent the positions of the start sound unit(SU) and the end sound unit (SU) of the first and last clusters,respectively. By this marking of parts, the movement of music data whichoccurs during editing can be tracked.

SU is the minimum unit of a part compressed according to the ATRAC3format. One SU is comprised of 1024 samples at 44.1 kHz (1024×16 bits×2channels) and can be compressed by a factor of 10. This corresponds toaround 23 msec of audio. Normally, a single part contains severalthousand SU. Thus, a cluster composed of 42 SU, stores about a second ofaudio.

Theoretically, the maximum number of parts comprising one track is 645.However, the actual number of parts usable in any given track is limitedby the header, the program name, the additional data, and the size ofthe additional information.

FIG. 10A is a diagram showing a file structure where two music programsof a CD or the like are successively recorded. The first program (file1) is composed of, for example, five clusters. Since one cluster doesnot contain two files, the second program (file 2), starts from thebeginning of the next cluster. Thus, the end of part 1 (file 1) is inthe middle of one cluster and the remaining area of the cluster containsno data. Likewise, the second music program (file 2) is composed of onepart. In the case of file 1, the part size is 5. The first clusterstarts at the 0-th SU. The last cluster ends at the 4-th SU.

There are four types of edit processes: a divide process, a combineprocess, an erase process, and a move process. The divide processdivides one track into two portions. When the divide process isperformed, the number of total tracks increases by one. In the divideprocess, one file is divided into two files on the file system. In thiscase, the reproduction management file and the FAT are also updated. Thecombine process combines two tracks into one track. When the combineprocess is performed, the number of total tracks decreases by one. Inthe combine process, two files are combined into one file on the filesystem. Thus, when the combine process is performed, the reproductionmanagement file and the FAT are also updated. The erase process erases atrack. When an erase process is performed, the number of tracksdecreases by one. The move process changes the track sequence. When theerase process or the move process is performed, the reproductionmanagement file and the FAT are, likewise, updated.

FIG. 10B is a diagram showing the result of combining the two programs(file 1 and file 2) shown in FIG. 10A. As a result of the combiningprocess, the combined file is composed of two parts. FIG. 10C is adiagram showing the result of one program (file 1) being divided in themiddle of cluster 2. As shown, file 1 is composed of clusters 0, 1, andthe beginning portion of cluster 2 and file 2 is composed of the endportion of cluster 2 and clusters 3 and 4.

As described above, since the part notation is defined for the result ofthe combining process (see FIG. 10B), the start position of part 1, theend position of part 1, and the end portion of part 2 can be definedwith SU. Thus, the music data of part 2 may not have to be moved to packthe space caused by the process. In addition, for the result of thedividing process (see FIG. 10C), data may not have to be moved and thespace packed at the begining of the file 2.

FIG. 11 is a schematic diagram showing the detailed data structure of areproduction management file, PBLIST. FIGS. 12A and 12B show a headerportion and the remaining portion, respectively, of the reproductionmanagement file of FIG. 11. As shown by FIGS. 12A and 12B, thereproduction management file contains a 32 byte header, a name NM1-Sarea (256 bytes) (for memory card 40), a name NM2-S area (512 bytes), acontents key area, a MAC area, an S-YMDhms area, a reproduction sequencemanagement table TRKTBL area (800 bytes), a memory card additionalinformation INF-S area (14720 bytes), and a redundant header informationarea. The start positions for each of these areas within thereproduction management file are predefined.

As shown in FIG. 12A, the first 32 bytes of (0×0000) to (0×000) are usedfor the header. Within the file, 16-byte areas are referred to as slots.The header is placed in the first and second slots indicated at 0×000and 0×0010. The area denoted as “Reserved” is an undefined area.Normally, a null (0×00) is written in reserved areas. However, even ifdata is written to a reserved area, the data is ignored. The reservedareas are intended for use in future revisions of the file format.Optional areas, when not used, are treated as reserved areas.Additionally, the reproduction management file header contains thefollowing defined areas:

-   -   =BLKID-TL0 (4 bytes)    -   Meaning: BLOCKID FILE ID    -   Function: Identifies the top of the reproduction management        file.    -   Value: Fixed value=“TL=0” (for example, 0×544C2D30)    -   =MCode (2 bytes)    -   Meaning: MAKER CODE    -   Function: Identifies the maker and model of recorder/player 1    -   Value: High-order 10 bits (Maker code); low-order 6 bits (model        code).    -   =REVISION (4 bytes)    -   Meaning: Number of rewrite times of PBLIST    -   Function: Increments whenever the reproduction management file        is rewritten.    -   Value: Starts at 0 and increments by 1.    -   =SY1C+L (2 bytes)    -   Meaning: Attribute of name (one byte code) of memory card 40        written in NM1-S area.    -   Function: Represents the character code and the language code as        one byte code.    -   Value: Character code (C): High-order one byte        -   00: Non-character code, binary number        -   01: ASCII (American Standard Code for Information            Interchange)        -   02: ASCII+KANA        -   03: Modified 8859-1        -   81: MS-JIS        -   82: KS C 5601-1989        -   83: GB (Great Britain) 2312-80        -   90: S-JIS (Japanese Industrial Standards) (for Voice)        -   Language code (L): Low-order one byte identifies the            language based on EBU Tech 3258 standard.        -   00: Not set        -   08: German        -   09: English        -   0A: Spanish        -   0F: French        -   15: Italian        -   1D: Dutch        -   65: Korean        -   69: Japanese        -   75: Chinese        -   When data is not recorded, this area is all 0.    -   =SN2C+L (2 bytes)    -   Meaning: Attribute of name of memory card 40 in NM2-S area.    -   Function: Represents the character code and the language coded        as one byte code.    -   Value: Same as SN1C+L    -   =SINFSIZE (2 bytes)    -   Meaning: Total size of additional information of memory card 40        in INF-S area.    -   Function: Represents the data size as an increment of 16 bytes.        When data is not recorded, this area is all 0.    -   Value: Size: 0×0001 to 0×39C (924)    -   =T-TRK (2 bytes)    -   Meaning: TOTAL TRACK NUMBER    -   Function: Represents the number of total tracks.    -   Value: 1 to 0×0190 (Max. 400 tracks) When data is recorded, this        area is all 0.    -   =VerNo (2 bytes)    -   Meaning: Format version number    -   Function: Represents the major version number (high order one        byte) and the minor version number (low order one byte).    -   Value: 0×0100 (Ver 1.0) 0×0203 (Ver 2.3)

Next, areas preceded by the header are described.

-   -   =NM1-S    -   Meaning: Name of memory card 40 (as one byte code)    -   Function: Represents the name of memory card 40 as one byte code        (max. 256). At the end of this area, an end code (0×00) is        written. The size is calculated from the end code. When data is        not recorded, null (0×00) is recorded from the beginning        (0×0020) of this area for at least one byte.    -   Value: Various character code    -   =NM2-S    -   Meaning: Name of memory card 40 (as two-byte code)    -   Function: Represents the name of memory card 40 as two-byte code        (max. 512). At the end of this area, an end code (0×00) is        written. The size is calculated from the end code. When data is        not recorded, null (0×00) is recorded from the beginning        (0×0120) of this area for at least two bytes.    -   Value: Various character code    -   =CONTENTS KEY    -   Meaning: Value for music program. Protected with MG(M) and        stored. Same as CONTENTS KEY.    -   Function: Used as a key necessary for calculating MAC of        S-YMDhms.    -   Value: 0 to 0×FFFFFFFFFFFFFFFF    -   =MAC    -   Meaning: Forged copyright information check value    -   Function: Represents the value generated with S-YMDhms and        CONTENTS KEY.    -   Value: 0 to 0×FFFFFFFFFFFFFFFF    -   =S-YMDhms (4 bytes) (Optional)    -   Meaning: Year, month, day, hour, minute, and second recorded by        recorder/player 1 with a reliable clock.    -   Function: Identifies the last recorded date and time. In this        case of EMD, this area is mandatory.    -   Value: bits 25 to 31: Year 0 to 99 (1980 to 2079) bits 21 to 24:        Month 0 to 12 bits 16 to 24: Day 0 to 31 bits 11 to 15: Hour 0        to 23 bits 05 to 10: Minute 0 to 59 bits 00 to 04: Second 0 to        29 (two second interval)    -   =TRK-nnn    -   Meaning: SQN (sequence) number of ATRAC3 data file reproduced.    -   Function: Represents FN0 of TRKINF.    -   Value: 1 to 400 (0×190) When there is no track, this area is all        0.    -   =INF-S    -   Meaning: Additional information of memory card 40 (for example,        information with respect to photos, songs, guides, etc.)    -   Function: Represents variable length additional information with        a header. A plurality of types of additional information may be        used. Each of the types of additional information has an ID and        a data size. Each additional information area including a header        is composed of at least 16 bytes and a multiple of 4 bytes. For        details, see the following section.    -   Value: Refer to the section of “Data Structure of Additional        Information”.

In the last slot of the reproduction management file, copies ofBLKID-TL0, MCode, and REVISION from the header are redundantly written.

If memory card 40 is accidentally detached or the power ofrecorder/player 1 turned off while data is being recorded into card 40,a termination error should be detected. As described above, a REVISIONarea is placed at the beginning and end of each block. Whenever data isrewritten, the value of the REVISION area is incremented. If atermination error occurs in the middle of writing a block, the value ofthe REVISION area at the beginning of the block will not match the valueof the REVISION area at the end of the block. This discrepancy betweenthe two REVISION areas allows termination errors to be determined with ahigh probability. When such an abnormal termination is detected; analarm, such as an error message, is generated.

In addition, because the fixed value BLKID-TL0 is written at thebeginning of one block (16 KB) the fixed value can be used as areference for recovering data. In other words, the fixed value allowsthe type of the file to be determined. Because the fixed value BLKID-TL0is redundantly written in the header and at the end of each block,reliability is secured. Alternatively, the entire reproductionmanagement file can be redundantly recorded.

ATRAC3 data files are not redundantly recorded because the amount ofdata in an ATRAC3 data file is much larger than in a track informationmanagement file. Instead, COONUM0 and BLOCK SERIAL values are used tohelp recover lost ATRAC3 data (as will be described below). In addition,one ATRAC3 data file may be composed of a plurality of blocks that aredispersed. To identify blocks of the same file, CONNUM0 is used and toidentify the order of the blocks BLOCK SERIAL is used. Likewise, asnoted above, a maker code (MCode) is redundantly recorded at thebeginning and the end of each block, so as to identify the maker of afile which has been improperly recorded.

FIG. 12C shows the structure of an additional information area. Theadditional information area is composed of a header comprised of thefollowing data, and additional variable length data:

-   -   =INF    -   Meaning: FIELD ID    -   Function: Represents the beginning of the additional information        (fixed value).    -   Value: 0×69    -   =ID    -   Meaning: Additional information key code    -   Function: Represents the category of the additional information.    -   Value: 0 to 0×FF    -   =SIZE    -   Meaning: Size of individual additional information    -   Function: Represents the size of each type of additional        information. Although the data size is not limited, it should be        at least 16 bytes and a multiple of 4 bytes. The rest of the        data should be filled with null (0×00).    -   Value: 16 to 14784 (0×39C0)    -   =MCode    -   Meaning: MAKER CODE    -   Function: Identifies the maker and model of recorder/player 1.    -   Value:. High-order 10 bits (maker code), low-order 10 bits        (machine code).    -   =C+L    -   Meaning: Attribute of characters in data area starting from byte        12.    -   Function: Represents the character code and the language code as        one byte code.    -   Value: Same as SNC+L    -   =DATA    -   Meaning: Individual additional information    -   Function: Represents each type of additional information with        variable length data. Real data always starts from byte 12. The        length (size) of the real data should be at least 4 bytes and a        multiple of 4 bytes. The rest of the data area should be filled        with null (0×00).    -   Value: Individually defined corresponding to the contents of        each type of additional information.

FIG. 13 is a table that correlates key code values 0 to 63 to additionalinformation and types thereof. Key code values 0 to 31 are assigned tomusic character information. Key code values 32 to 63 are assigned toUniform Resource Locator (“URL”) information (web information). Themusic character information and URL information contain characterinformation of the album title, the artist name, the CM, and so forth asadditional information.

FIG. 14 is a table that correlates key code values 64 to 127 toadditional information and types thereof. Key code values 64 to 95 areassigned to path/others. Key code values 96 to 127 are assigned tocontrol/numeric data. For example, ID=98 represents TOC_ID as additionalinformation. TOC_ID represents the first music program number, the lastmusic program number, the current program number, the total performanceduration, and the current music program duration corresponding to theTable of Contents (“TOC”) information of a CD.

FIG. 15 is a table that correlates key code values 128 to 159 toadditional information and types thereof. Key code values 128 to 159 areassigned to synchronous reproduction information. In FIG. 15, EMDrepresents electronic music distribution.

Next, with reference to FIGS. 16A to 16E, examples of additionalinformation will be described. FIG. 16A shows a data structure ofadditional information. In FIG. 16B, key code ID=3 (artist name asadditional information), SIZE=0×1C (28 bytes) which represents that thedata length of additional information including the header is 28 bytes ;and C+L which represents that character code C=0×01 (ASCII) and languagecode L=0×09 (English). Variable length data after byte 12 represents onebyte data “SIMON & GRAFUNKEL” as artist name. Since the data length ofthe additional information should be a multiple of 4 bytes, the rest isfilled with (0×00).

In FIG. 16C, key code ID=97 which represents ISRC (InternationalStandard Recording Code: Copyright code) as additional information,SIZE=0×14 (20 bytes) which represents that the data length of theadditional information is 20 bytes, and C=0×00 and L=0×00 whichrepresents that characters and language have not been set. Thus, thedata is binary code. The variable length data is an eight-byte ISRC coderepresenting copyright information (nation, copyright owner, recordedyear, and serial number).

In FIG. 16D, key code ID=103 which represents recorded date and time asadditional information, SIZE=0×10 (16 bytes) which represents that thedata length of the additional information is 16 bytes, and C=0×00 andL=0×00 which represent that characters and language have not been set.The variable length data is a four-byte code (32 bit) representing therecorded date and time (year, month, day, hour, minute, second).

In FIG. 16E, key code ID=107 which represents a reproduction log asadditional information, SIZE=0×10 (16 bytes) which represents that thedata length of the additional information is 16 bytes, and C=0×00 andL=0×00 which represent that characters and language have not been set.The variable length data is a four-byte code representing a reproductionlog (year, month, day, hour, minute, second). Illustratively, whenrecorder/player 1 has a reproduction log function, it records log dataof 16 bytes whenever it reproduces music data.

FIG. 17 is a diagram showing the data arrangement of an ATRAC3 data fileA3Dnnnn where 1 SU is N bytes (for example, N=384 bytes). FIG. 17 alsoshows an attribute header (1 block) of a data file and a music data file(1 block) along with the first byte (0×0000 to 0×7FFF) of each slot ofthe two blocks (16×2=32 kbytes). As shown in FIG. 18, the first 32 bytesof the attribute header are used as a header; 256 bytes are used as amusic program area NM1 (256 bytes); and 512 bytes are used as a musicprogram title area NM2 (512 bytes). The header of the ATRAC3 data filecontains the following areas:

-   -   =BLKID-HD0 (4 bytes)    -   Meaning: BLOCKID FIELD ID    -   Function: Identifies the top of an ATRAC3 data file.    -   Value: Fixed value=“HD=0” (For example, 0×48442D30)    -   =MCode (2 bytes)    -   Meaning: MAKER CODE    -   Function: Identifies the maker and model of the recorder/player        1    -   Value: High-order 10 bits (maker code); low-order 6 bits        (machine code)    -   =BLOCK SERIAL (4 bytes)    -   Meaning: Track serial number    -   Function: Starts from 0 and increments by 1. Even if a music        program is edited, this value does not vary.    -   Value: 0 to 0×FFFFFFFF.    -   =N1C+L (2 bytes)    -   Meaning: Represents the attribute of data (NM1) of a track        (music program title).    -   Function: Represent the character code and language code of NM1        as one byte code.    -   Value: Same as SN1C+L    -   =N2C+L (2 bytes)    -   Meaning: Represents the attribute of data (NM2) of a track        (music program title).    -   Function: Represent the character code and language code of NM1        as one byte code.    -   Value: Same as SN1C+L    -   =INFSIZE (2 bytes)    -   Meaning: Total size of additional information of current track.    -   Function: Represents the data size as a multiple of 16 bytes.        When data is not recorded, this area should be all 0.    -   Value: 0×0000 to 0×3C6 (966)    -   =T-PRT (2 bytes)    -   Meaning: Number of total bytes    -   Function: Represents the number of parts that composes the        current track. Normally, the value of T-PRT is 1.    -   Value: 1 to 285 (645 dec).    -   =T-SU (4 bytes)    -   Meaning: Number of total SU.    -   Function: Represents the total number of SU in one track that is        equivalent to the program performance duration.    -   Value: 0×01 to 0×001FFFFF    -   =INX (2 bytes) (Optional)    -   Meaning: Relative position of INDEX    -   Function: Used as a pointer that represents the top of a        representative portion of a music program. The value of INX is        designated with a value of which the number of SU is divided by        4 as the current position of the program. This value of INX is        equivalent to 4 times larger than the number of SU (around 93        msec). Value: 0 to 0×FFFF (max, around 6084 sec)    -   =XT (2 bytes) (Optional)    -   Meaning: Reproduction duration of INDEX    -   Function: Designates the reproduction duration designated by        INX-nnn with a value of which the number of SU is divided by 4.        The value of INDEX is equivalent to four times larger than the        normal SU (around 93 msec).    -   Value: 0×0000 (no setting); 0×01 to 0×FFFE (up to 6084 sec);        0×FFFF (up to end of music program)

Next, the music program title areas NM1 and NM2 are described.

-   -   =NM1    -   Means: Character string of music program title    -   Function: Represents a music program title as a one-byte code        (up to 256 characters) (variable length). The title area should        be completed with an end code (0×00). The size should be        calculated from the end code. When data is not recorded, null        (0×00) should be recorded from the beginning (0×0020) of the        area for at least one byte.    -   Value: Various character codes    -   =NM2    -   Means: Character string of music program title    -   Function: Represents a music program title as two byte code (up        to 512 characters) (variable length). The title area should be        completed with an end code (0×00). The size should be calculated        from the end code. When data is not recorded, null (0×100)        should be recorded from the beginning (0×0120) of the area for        at least two bytes.    -   Value: Various character codes

Data of 80 bytes starting from the fixed position (0×320) of theattribute header is referred to as track information area TRKINF. Thisarea is mainly used to totally manage the security information and copycontrol information of the particular track. FIG. 19 shows a part ofTRKINF. The TRKINF area contains the following areas:

-   -   CONTENTS KEY (8 bytes)    -   Meaning: Value for each music program. The value of CONTENTS KEY        is protected in security block 52 of memory card 40 and then        stored.    -   Function: Used as a key for reproducing a music program. It is        used to calculate the value of MAC.    -   Value: 0 to 0×FFFFFFFFFFFFFFFF    -   =MAC (8 bytes)    -   Meaning: Forged copyright information check value.    -   Function: Represents the value generated with a plurality of        values of TRKINF including contents cumulation numbers and a        secret sequence number. The secret sequence number is a sequence        number recorded in the secret area of memory card 40. A        non-copyright protection type recorder cannot read data from a        secret area of memory card 40. On the other hand, a copyright        protection type recorder and a computer that operates with a        program that can read data from a memory card can access the        secret area.    -   =A (1 byte)    -   Meaning: Attribute of a part.    -   Function: Represents the information on such as compression mode        of a part.    -   Value: See discussion hereinafter (see FIGS. 19 and 20).

Next, the value of area A is described. In the following description,monaural mode (N=0 or 1) is defined as a special joint mode in which bit7=1, sub signal=0, and main signal=(L+R). A player without a copyrightprotection capability may ignore information bits 1 and 2.

Bit 0 of area A indicates whether emphasis is on or off. Bit 1 indicatesskip reproduction or normal reproduction. Bit 2 designates the data typesuch as audio data, FAX data, or the like. Bit 3 is undefined. Modeinformation for ATRAC3 is represented as a combination of bits 4, 5, and6, as shown in FIG. 20. In other words, N indicates mode and isrepresented with 3 bits. In FIG. 20, for the five types of modes listed(monaural (N=0 or 1), LP (N=2), SP (N=4), EX (N=5), and HQ (N=7)),record duration (64 MB memory card), data transmission rate, and thenumber of SU per block are provided. The number of bytes in each SUdepends on the defined mode. In one monaural mode 1 SU has 136 bytes. Inthe LP mode 1 SU has 192 bytes. In the SP mode 1 SU has 304 bytes. Inthe EX mode 1 SU has 384 bytes. In the HQ mode 1 SU has 512 bytes. Bit 7of area A represents ATRAC3 type modes (0: Dual, 1: Joint).

As an example , a 64 MB memory card used in the SP mode is described. A64 MB memory card has 3968 blocks. In the SP mode, since 1 SU has 304bytes, a block is comprised of 53 SUs. Hence, 1 SU is equivalent to(1024/44100) seconds. Thus, a 64 MB memory card stores(1024/44100)×53×(3968−10)=4863 seconds=81 minutes. The transmission rateis (44100/1024)×304×8=104737 bps.

Referring back to FIG. 19, the remainder of the areas of TRKINF will bedescribed.

-   -   =LT (one byte)    -   Meaning: Reproduction restriction flag (bits 7 and 6) and        security partition (bits 5 to 0).    -   Function: Represents a restriction of the current track.    -   Value: bit 7: 0=no restriction, 1=restriction bit 6: 0=not        expired, 1=expired bits 5 to 0: security partition (reproduction        prohibited other than 0)    -   =FNo (2 bytes)    -   Meaning: File number.    -   Function: Represents the initially recorded track number that        designates the position of the MAC calculation value recorded in        the secret area of memory card 40.    -   Value: 1 to 0×190 (400)    -   =MG(D) SERIAL-nnn (16 bytes)    -   Meaning: Represents the serial number of security IC 20 of the        recorder/player 1.    -   Function: Unique value for each recorder/player.    -   Value: 0 to 0×FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF    -   CONNUM (4 bytes)    -   Meaning: Contents cumulation number.    -   Function: Represents a unique value cumulated for each music        program. The value is managed by security IC 20 of        recorder/player 1. The upper limit of the value is 232 that is        4,200,000,000. Used to identify a recorded program.    -   Value: 0 to 0×FFFFFFFF    -   =YMDhms-S (4 bytes) (Optional)    -   Meaning: Reproduction start date and time of track with        reproduction restriction.    -   Function: Represents the date and time at which data        reproduction is permitted with EMD.    -   Value: Same as the notation of date and time of other areas.    -   =YMDhms-E (4 bytes) (Optional)    -   Meaning: Reproduction end date and time of track with        reproduction restriction.    -   Function: Represents the date and time at which data        reproduction is expired with EMD.    -   Value: Same as the notation of date and time of other areas.    -   =MT (1 byte) (Optional)    -   Meaning: Maximum value of number of permitted reproduction        times.    -   Function: Represents the maximum number of reproduction times        designated by EMD.    -   Value: 1 to 0×FF. When not used, the value of the area MT is 00.    -   =CT (1 byte) (Optional)    -   Meaning: Number of reproduction times.    -   Function: Represents the number of remaining permitted        reproduction times. Whenever data is reproduced, the value of        the area CT is decremented.    -   Value: 0×00 to 0×FF. When not used, the value of the area. CT is        0×00. When bit 7 of the area LT is 1 and the value of the area        CT is 00, data is prohibited from being reproduced.    -   =CC (1 byte)    -   Meaning: COPY CONTROL    -   Function: Controls the copy operation.    -   Value: (see FIG. 21) bits 6 and 7 represent copy control        information, bits 4 and 5 represent copy control information of        a high speed digital copy operation, bits 2 and 3 represent a        security block authentication level, and bits 0 and 1 are        undefined.    -   Example of CC:        -   (bits 7 and 6)        -   11: Unlimited copy operation permitted        -   01: copy prohibited        -   00: one time copy operation permitted        -   (bits 3 and 2)        -   00: analog/digital input recording            -   MG authentication level is 0. When digital record                operation using data from a CD is performed, (bits 7 and                6): 00 and (bits 3 and 2): 00.    -   =CN (1 byte) (Optional)    -   Meaning: Number of permitted copy times in high speed serial        copy management system.    -   Function: Extends the copy permission with the number of copy        times, not limited to one time copy permission and copy free        permission. Valid only in first copy generation. The value of        the area CN is decremented whenever the copy operation is        performed.    -   Value:        -   00: Copy prohibited        -   01 to 0×FE: Number of times        -   0×FF: Unlimited copy times

Referring once again to FIG. 17, the track information area TRKINF isfollowed by a 24-byte part management information area (PRTINF) startingat 0×0370. When a track is composed of a plurality of parts, theaddresses of the individual parts are successively arranged in PRTINF.FIG. 22 shows a portion of the PRTINF area. Next, the PRTINF area isdescribed in order of arrangement.

-   -   =PRTSIZE (4 bytes)    -   Meaning: Part size    -   Function: Represents the size of a part. Cluster: 2 bytes        (highest position), start SU: 1 byte (upper), end SU: 1 byte        (lowest position).    -   Value: cluster: 1 to 0×1F40 (8000) start SU: 0 to 0×A0 (160) end        SU: 0 to 0×A0 (16) (Note that SU starts from 0.)    -   =PRTKEY (8 bytes)    -   Meaning: Part encrypting value    -   Function: Encrypts a part. Initial value=0. Note that edit rules        should be applied.    -   Value: 0 to 0×FFFFFFFFFFFFFFFF    -   =CONNUM0 (4 bytes)    -   Meaning: Initially generated contents cumulation number key    -   Function: Uniquely designates an ID of contents.    -   Value: Same value as the value of the contents cumulation number        initial value key

As is next shown in FIG. 17, the attribute header of an ATRAC3 data filecontains an additional information INF area. The additional informationis the same as the additional information INF-S area (see FIGS. 11 and12B) of the reproduction management file except that the start positionis not fixed. The last byte position (a multiple of four bytes) at theend of one or a plurality of parts is followed by the additionalinformation INF area.

-   -   =INF    -   Meaning: Additional information of a track.    -   Function: Represents variable length additional information with        a header. A plurality of different types of additional        information may be arranged. Each of additional information        areas has an ID and a data size. Each additional information        area is composed of at least 16 bytes and a multiple of 4 bytes.    -   Value: Same as additional information INF-S of reproduction        management file

The above-described attribute header is followed by a plurality of datablocks. To each data block a header is added. Next, each block of theadded header as shown in FIG. 23 is described.

-   -   BLKID-A3D (4 bytes)    -   Meaning: BLOCK ID FILE ID    -   Function: Identifies the top of ATRAC3 data.    -   Value: Fixed value=“A3D” (for example, 0×41334420)    -   =MCode (2 bytes)    -   Meaning: MAKER CODE    -   Function: Identifies the maker and model of recorder/player 1.    -   Value: High-order 10 bits (maker code); low-order 6 bits (model        code)    -   =CONNUMO (4 bytes)    -   Meaning: Cumulated number of initially created contents.    -   Function: Designates a unique ID for contents. Even if the        contents are edited, the value of the area CONNUMO is not        changed.    -   Value: Same as the contents cumulation number initial key.    -   =BLOCK SERIAL (4 bytes)    -   Meaning: Serial number assigned to each track.    -   Function: Starts from 0 and increments by 1. Even if the        contents are edited, the value of the area BLOCK SERIAL is not        changed.    -   Value: 0 to 0×FFFFFFFF    -   =BLOCK-SEED (8 bytes)    -   Meaning: Key for encrypting one block.    -   Function: The beginning of the block is a random number        generated by security IC 20 of recorder/player 1. The random        number is followed by a value incremented by 1. When the value        of the area BLOCK-SEED is lost, since sound is not generated for        approximately one second or equivalent to one block, the same        data is written to the header and the end of the block. Even if        the contents are edited, the value of the area BLOCK-SEED is not        changed.    -   Value: Initially 8-bit random number.    -   =INITIALIZATION VECTOR (8 bytes)    -   Meaning: Value used for encrypting/decrypting ATRAC3 data.    -   Function: Represents an initial value used for encrypting and        decrypting ATRAC3 data for each block. A block starts from 0.        The next block starts from the last encrypted 8-bit value at the        last SU. When a block is divided, the last eight bytes just        before-the start SU is used. Even if the contents are edited,        the value of the area INITIALIZATION VECTOR is not changed.    -   Value: 0 to 0×FFFFFFFFFFFFFFFF    -   =SU-nnn    -   Meaning: Data of sound unit.    -   Function: Represents data compressed from 1024 samples. The        number of bytes of data depends on the compression mode. Even if        the contents are edited, the value of the area SU-nnn is not        changed. For example, in the SP mode, N=384 bytes.    -   Value: Data value of ATRAC3

In FIG. 17, since N=384, 42 SUs are written to one block. The first twoslots (4 bytes) of the block are used as a header. In the last slot (twobytes), BLKID-A3D, MCode, CONNUM0, and BLOCK SERIAL are redundantlywritten. Thus, M bytes of the remaining area of one block is(16,384−384×42−16×3=208) bytes. As described above, the eight-byte areaBLOCK SEED is also redundantly recorded.

If the FAT area is destroyed, all blocks of flash memory 42 aresearched. It is determined whether the value of the area ID BLKID at thebeginning of each block is TL0, HD0, or A3D. As shown in FIGS. 24A to24C, at step SP1, it is determined whether or not the value of the areaID BLKID at the beginning of the top block is BLKID-TL0. If thedetermined result at step SP1 is No, the flow advances to step SP2. Atstep SP2, the block number is incremented. Thereafter, at step SP3, itis determined whether or not the last block has been searched.

If the determined result at step SP3 is No, the flow returns to stepSP1. If the determined result is Yes,

If the determined result at step SP1 is Yes, the flow advances to stepSP4. At step SP4, the searched block is the reproduction management filePBLIST. Thereafter, the flow advances to step SP5. At step SP5, thenumber of total tracks T-TRK in the reproduction management file PBLISTis stored as N to the register. For example, if 10 ATRAC3 data files (10music programs) are stored in memory 42, then 10 is stored in T-TRK.

Next, at step SP6, with reference to the value of the number of totaltracks T-TRK, TRK-001 to TRK-400 of blocks are successively referenced.In this example, since 10 music programs have been recorded, TRK-001 toTRK-010 of blocks are referenced. At step SP7, since a file number FNOhas been recorded in TRK-XXX (where X=1 to 400), a table that correlatesthe track number TRK-XXX and the file number FNO is stored to memory 42.Next, at step SP8, N stored in the register is decremented. A loop ofsteps SP6, SP7, and SP8 is repeated until N becomes 0 at step SP9.

If the determined result at step SP9 is Yes, the flow advances to stepSP10. At step SP10, a pointer is reset to the top block. The searchingprocess is repeated from the top block. Thereafter, the flow advances tostep SP11. At step SP11, it is determined whether or not the value ofthe area ID BLKID of the top block is BLKID-HD0. If the determinedresult at step SP11 is No, the flow advances to step SP12. At step SP12,the block number is incremented. At step SP13, it is determined whetheror not the last block has been searched.

If the determined result at step SP13 is No, the flow returns to stepSP11. The searching process is repeated until the determined result atstep SP11 becomes Yes.

If the determined result at step SP11 is Yes, the flow advances to stepSP14. At step SP14, it is determined that the block is the attributeheader (see FIG. 9) (0×0000 to 0×03FFF shown in FIG. 18) at thebeginning of the ATRAC3 data file.

Next, at step SP15, the file number FNO, the sequence number BLOCKSERIAL of the same ATRAC data file, and the contents cumulation numberkey CONNUM0 contained in the attribute header are stored to memory 42.If 10 ATRAC3 data files have-been recorded, since there are 10 blocks ofwhich the value of the area ID BLKID is BLKID-TL0, the searching processis continued until 10 blocks are searched.

If the determined result at step SP13 is Yes, the flow advances to stepSP16. At step SP16, the pointer is reset to the top block. The searchingprocess is repeated from the top block.

Thereafter, the flow advances to step SP17. At step SP17, it isdetermined whether or not the value of the, area ID BLKID of the topblock is BLKID-A3D.

If the determined result at step SP17 is No, the flow advances to stepSP18. At step SP18, the block number is incremented. Thereafter, at stepSP18′, it is determined whether or not the last block has been searched.When the determined result at step SP18′ is No, the flow returns to stepSP17.

If the determined result at step SP17 is Yes, the flow advances to stepSP19. At step SP19, it is determined that the block contains ATRAC3data. Thereafter, the flow advances to step SP20. At step SP20, thecurrent block number is correlated with the serial number BLOCK SERIALrecorded in the ATRAC3 data block and the contents cumulation number keyCONNUM0, and the results thereof are stored to memory 42.

In the same ATRAC3 data file, the common number is assigned as thecontents cumulation number key CONNUM0. In other words, if one ATRAC3data file is composed of 10 blocks, a common number is assigned to allthe values of the CONNUM0 areas.

In addition, if one ATRAC3 data file is composed of 10 blocks, serialnumbers 1 to 0 are assigned to the values of the BLOCK SERIAL areas ofthe 10 blocks.

Corresponding to the values of the CONNUM0 and BLOCK SERIAL areas; it isdetermined whether the current block composes the same contents andreproduction order for the same contents in the current block (namely,the connection sequence).

If 10 ATRAC3 data files (namely, 10 music programs) are recorded andeach of the ATRAC3 data files is composed of 10 blocks, there are 100data blocks.

With reference to the values of the CONNUM0 and BLOCK SERIAL areas, thereproduction order of music programs of 100 data blocks and theconnection order thereof can be obtained.

If the determined result at step SP18′ is Yes, all the blocks have beensearched for the reproduction management file, the ATRAC3 data file, andthe attribute file. Thus, at step SP21, based on the values of theCONNUM0, BLOCK SERIAL, FNO, and TRK-X areas in the order of blocknumbers of the blocks stored in memory 42, the file connection state isobtained.

After the connection state is obtained, the FAT may be generated in afree area of memory 42.

Next, a management file according to another embodiment of the presentinvention will be described. FIG. 25 shows the file structure accordingto the second embodiment of the present invention. Referring to FIG. 25,a music directory contains a track information management fileTRKLIST.MSF (hereinafter, referred to as TRKLIST), a backup trackinformation management file TRKLISTB.MSF (hereinafter, referred to asTRKLISTB), an additional information file INFLIST.MSF (that contains anartist name, an ISRC code, a time stamp, still picture data, and soforth (this file is referred to as INFLIST)), and an ATRAC3 data fileA3Dnnnn.MSA (hereinafter, referred to as A3nnnn). The file TRKLISTcontains two areas NAME1 and NAME2. The area NAME1 contains the memorycard name and the program name (for one byte code corresponding toASCII/8859-1 character code). The area NAME2 contains the memory cardname and the program name (for a two byte code corresponding toMS-JIS/Hankul/Chinese code).

FIG. 26 shows the relationship between the track information managementfile TRKLIST, the areas NAME1 and NAME2, and the ATRAC3 data fileA3Dnnnn. The file TRKLIST is a fixed-length file of 64 kbytes (=16 k×4).An area of 32 kbytes of the file is used for managing tracks. Theremaining area of 32 kbytes is used to contain the areas NAME1 andNAME2. Although the areas NAME1 and NAME2 for program names may beprovided as a separate file from the track information management file,in a system having a small storage capacity, it is convenient to managethe track information management file and program name files together.

The track information area TRKINF-nnnn and part information areaPRTINF-nnnn of the track information management file TRKLIST are used tomanage the data file A3Dnnnn and the additional information INFLIST.Only the ATRAC3 data file A3Dnnnn is encrypted. In FIG. 26, the datalength in the horizontal direction is 16 bytes (0 to F). A hexadecimalnumber in the vertical direction represents the value at the beginningof the current line.

According to this embodiment, three files: the track management fileTRKLIST (including a program title file), the additional informationmanagement file INFLIST, and the data file A3Dnnnn are used. Accordingto the previous embodiment described with reference to FIGS. 7, 8, and9, two files: the reproduction management file PBLIST for managingmemory card 40 and the data file ATRAC3 for storing programs are used.

Next, the data structure according to this embodiment will be described.For simplicity, in this data structure, the description of similarportions to those of the previous embodiment is omitted.

FIG. 27 shows the structure of the track information management fileTRKLIST. In the track information management file TRKLIST, one cluster(block) is composed of 16 kbytes. The size and data of the file TRKLISTare the same as those of the backup file TRKLISTB. The first 32 bytes ofthe track information management file are used as a header. As with theheader of the reproduction management file PBLIST, the header of thefile TRKLIST contains a BLKID-TL0/TL1 (backup file ID) area (4 bytes),an area T-TRK (2 bytes) for the number of total tracks, a maker codearea MCode (2 bytes), an area REVISION (4 bytes) for the number ofTRKLIST rewrite times, and an area S-YMDhms (4 bytes) (Optional) forupdate date and time data. The meanings and functions of these dataareas are the same as those of the previous embodiment. In addition, thefile TRKLIST contains the following areas:

-   -   =YMDhms (4 bytes)    -   Represents the last update date (year, month, day) of the file        TRKLIST.    -   =N1 (1 byte) (Optional)    -   Represents the sequential number of memory card 40 (numerator        side). When one memory card is used, the value of the area N1 is        0×01.    -   =N2 (1 byte) (Optional)    -   Represents the sequential number of memory card 40 (denominator        side). When one memory card is used, the value of the area N2 is        0×01.    -   =MSID (2 bytes) (Optional)    -   Represents the ID of memory card 40. When a plurality of memory        cards is used, the value of the area MSID of each memory card is        the same (T.B.D.). (T.B.D. (to be defined) represents that this        value may be defined in future).    -   =S-TRK (2 bytes).    -   Represents a special track (T.B.D.). Normally, the value of the        area S-TRK is 0×0000.    -   =PASS (2 bytes) (Optional)    -   Represents a password (T.B.D.).    -   =APP (2 bytes) (Optional)    -   Represents the definition of a reproduction application (T.B.D.)        (normally, the value of the area APP is 0×0000).    -   =INF-S (2 bytes) (Optional)

Represents the additional information pointer of the entire memory card40. When there is no additional information, the value of the area INF-Sis 0×00.

The last 16 bytes of the file TRKLIST are used for an area BLKID-TL0, anarea MCode, and an area REVISION that are the same as those of theheader. The-backup file TRKLISTB contains the above-described header. Inthis case, the header contains an area BLKID-TL1, an area MCode, and anarea REVISION.

The header is followed by a track information area TRKINF which may haveinformation with respect to each track and a part information areaPRTINF which may have information with respect to each part of thetracks (music programs). FIG. 27 shows the areas preceded by the areaTRKLIST. The lower portion of the area TRKLISTB shows the structure ofthese areas. In FIG. 27, a shaded area represents an unused area.

The track information area TRKINF-nnn and the part information areaPRTINF-nnn contain areas of an ATRAC3 data file. In other words, thetrack information area TRKINF-nnn and the part information areaPRTINF-nnn each contain a reproduction restriction flag area LT (1byte), a contents key area CONTENTS KEY (8 bytes), a recorder/playersecurity IC serial number area MG(D) SERIAL (16 bytes), an area XT (2bytes) (Optional) for representing a feature portion of a music program,an area INX (2 bytes) (Optional), an area YMDhms-S (4 bytes) (Optional),an area YMDhms-E (4 bytes) (Optional), an area MT (1 byte) (Optional),an area CT (1 byte) (Optional), an area CC (1 byte) (Optional), an areaCN (1 byte) (Optional) (areas YMDhms-S, YMDhms-E, MT, CT, CC, and CN areused for reproduction restriction information and copy controlinformation), an area A (1 byte) for part attribute, a part size areaPRTSIZE (4 bytes), a part key area PRTKEY (8 bytes), and a contentscumulation number area CONNUM (4 bytes). The meanings, functions, andvalues of these areas may be the same as those of the previousembodiment. In addition, the track information area TRKINF-nnn and thepart information area PRTINF-nnn each contain the following areas:

-   -   =T0 (1 byte)    -   Fixed value (T0=0×74)    -   =INF-nnn (Optional) (2 bytes)    -   Represents the additional information pointer (0 to 409) of each        track. 00: music program without additional information.    -   =FNM-nnn (4 bytes)    -   Represents the file number (0×0000 to 0×FFFF) of an ATRAC3 data        file.    -   The number nnnn (in ASCII) of the ATRAC3 data file name        (A3Dnnnn) is converted into 0×nnnnn.    -   APP_CTL (4 bytes) (Optional)    -   Represents an application parameter (T.B.D.). (Normally, the        value of the area APP_CTL is 0×0000),    -   =P-nnn (2 bytes)    -   Represents the number of parts (1 to 2039) that compose a music        program. This area corresponds to the above-described area        T-PART.    -   =PR (1 byte)    -   Fixed value (PR=0×50).

Next, the areas NAME1 (for one byte code) and NAME2 (for two byte code)for managing names will be described. FIG. 28 shows the structure of thearea NAME1 (for one byte code area). Each of the areas NAME1 and NAME2(which will be described later) is segmented into eight byte slots. At0×8000, which is the beginning of each of these areas, a header isplaced. The header is followed by a pointer and a name. The last slot ofthe area NAME1 contains the same areas as the header.

-   -   =BLKID-NM1 (4 bytes)    -   Represents the contents of a block (fixed value)        (NM1=0×4E4D2D31).    -   =PNM1-S    -   Represents the pointer to a name representing a memory card.    -   nnn (=1 to 408) represents the pointer to a music program title.    -   The pointer represents the start position (2 bytes) of the        block, the character code type (2 bits), and the data size (14        bits).    -   =PNM1-nnn (4 bytes) (Optional)    -   Represents the pointer to the area NM1 (for one byte code).    -   =NM1-nnn (Optional)    -   Represents memory card name and music program title in a one        byte code (variable length). An end code (0×00) is written at        the end of the area.

FIG. 29 shows the data structure of the area NAME2 (for two byte code).At 0×C000, which is the beginning of the area, a header is placed. Theheader is followed by a pointer and a name. The last slot of the areaNAME2 contains the same areas as the header.

-   -   =BLKID-NM2 (4 bytes)    -   Represents the contents of a block (fixed value)        (NM2=0×4E4D2D32).    -   PNM2-nnn (4 bytes) (Optional)    -   Represents the pointer to the area NM2 (for two byte code).    -   PNM2-S represents the pointer to a name representing memory card        40. nnn (=1 to 408) represents the pointer to a music program        title.    -   The pointer represents the start position (2 bytes) of the        block, the character code type (2 bits), and the data size (14        bits).    -   NM2-nnn (Optional)    -   Represents memory card name and music program title in a two        byte code (variable). An end code (0×0000) is written at the end        of the area.

FIG. 30 shows the data arrangement (for one block) of the ATRAC3 datafile A3Dnnnn in the case that 1 SU is composed of N bytes. In this file,one slot is composed of eight bytes. FIG. 30 shows the values of the topportion (0×0000 to 0×3FF8) of each slot. The first four slots of thefile are used for a header. The header contains an area BLKID-A3D (4bytes), a maker code area MCode (2 bytes), an area BLOCK SEED (8 bytes)used for the encrypting process, an area CONNUM0 (4 bytes) for theinitial contents cumulation number, a serial number area BLOCK SERIAL (4bytes) for each track, and an area INITIALIZATION VECTOR (8 bytes) usedfor the encrypting/decrypting process. The penultimate slot of the blockredundantly contains an area BLOCK SEED. The last slot contains areasBLKID-A3D and MCode. The header is followed by the sound unit dataSU-nnnn.

FIG. 31 shows the data structure of the additional informationmanagement file INFLIST that contains additional information. At thebeginning (0×0000) of the file INFLIST, a header comprising thefollowing is placed. The header is followed by the subsequentlydescribed pointer and areas.

-   -   =BLKID-INF (4 bytes)    -   Represents the contents of the block (fixed value)        (INF=0×494E464F).    -   =T-DAT (2 blocks)    -   Represents the number of total data areas (0 to 409).    -   MCode (2 bytes)    -   Represents the maker code of recorder/player 1.    -   =YMDhms (4 bytes)    -   Represents the record updated date and time.    -   =INF-nnnn (4 bytes)    -   Represents the pointer to the area DATA of the additional        information (variable length, as 2 bytes (slot) at a time). The        start position is represented with the high order 16 bits (0000        to FFFF).    -   =DataSlot-0000 (0×0800)    -   Represents the offset value from the beginning (in increments of        a slot).

The data size is represented with low order 16 bits (0001 to 7FFF). Adisable flag is set at the most significant bit. MSB=0 (Enable), MSB=1(Disable)

The data size represents the total data amount of the music program.

(The data starts-from the beginning of each slot. The non-data area ofthe slot is filled with 00.)

The first INF represents a pointer to additional information of theentire album (normally, INF-409).

FIG. 32 shows the structure of additional information. An 8-byte headeris placed at the beginning of one additional information data area. Thestructure of the additional information is the same as that describedwith reference to FIG. 12C. In other words, the additional informationcontains an area IN (2 bytes) as an ID, an area key code ID (1 byte), anarea SIZE (2 bytes) that represents the size of each additionalinformation area, and a maker code area MCode (2 bytes). In addition,the additional information contains an area SID (1 byte) as a sub ID.

According to this embodiment of the present invention, in addition tothe file system defined as a format of memory card 40, the trackinformation management file TRKLIST for music data is used. Thus, evenif the FAT is destroyed, a file can be recovered. FIG. 33 shows a flowof a file recovering process. To recover a file, a computer thatoperates with a file recovery program and that can access memory card 40and a storing device (hard disk, RAM, or the like) connected to thecomputer are used. The computer has a function equivalent to DSP 30.Next, a file recovering process using the track management file TRKLISTwill be described.

All blocks of flash memory 42 whose FAT has been destroyed are searchedfor TL-0 as the value (BLKID) at the top position of each block. Inaddition, all of the blocks are searched for NM-1 as the value (BLKID)at the top position of each block. Thereafter, all of the blocks aresearched for NM-2 as the value (BLKID) at the top position of eachblock. The contents of the four blocks (track information managementfile) are stored to, for example, a hard disk by the recovery computer.

The number of total tracks is obtained from data after the fourth byteof the track information management file. The 20-th byte of the trackinformation area TRKINF-001, the value of the area CONNUM-001 of thefirst music program, and the value of the next area P-001 are obtained.The number of parts is obtained with the value of the area P-001. Thevalues of the areas PRTSIZE of all parts of track I of the area PRTINFare obtained. The number of total blocks (clusters) n is calculated andobtained.

After the track information management file is obtained, the flowadvances to step 102. At step 102, a voice data file (ATRAC3 data file)is searched. All blocks other than the management file is searched fromflash memory 42. Blocks whose top value (BLKID) is A3D are collected.

A block with the value of the area CONNUM0 at the 16-th byte of A3Dnnnnbeing the same as that of the area CONNUM-001 of the first music programof the track information management file, and with the value of the areaBLOCK SERIAL starting from the 20-th byte being 0 is searched. After thefirst block is obtained, a block (cluster) with the same value for thearea CONNUM as the first block and of which the value of BLOCK SERIAL isincremented by 1 (1=0+1) is searched. After the second block isobtained, a block with the same value for the area CONNUM0 as the secondblock and of which the value of the area BLOCK SERIAL is incremented by1 (2=1+1) is searched.

By repeating the process, the ATRAC3 data file is searched until nblocks (clusters) of track 1 are obtained. When all the blocks(clusters) are obtained, they are successively stored to the hard disk.

The same process for track 1 is performed for track 2. In other words, ablock with the value of the area CONNUM0 being the same as that of thearea CONNUM-002 of the first music program of the track informationmanagement file, and with the value of the area BLOCK SERIAL starting atthe 20-th byte being 0 is searched. Thereafter, in the same manner astrack 1, the ATRAC3 data file is searched until the last block (cluster)n′ is detected. After all blocks (clusters) are obtained, they aresuccessively stored to the hard disk.

By repeating the above-described process for all tracks (the number oftracks: m), all of the ATRAC3 data is stored to the hard disk controlledby the recovering computer.

At step 103, memory card 40 whose FAT has been destroyed isre-initialized and then the FAT is reconstructed. A predetermineddirectory is formed in memory card 40. Thereafter, the track informationmanagement file and the ATRAC3 data file for m tracks are copied fromthe hard disk to memory card 40. Thus, the recovery process is finished.

In the management file and data file important parameters (inparticular, codes in headers) may be recorded in triplicate instead ofduplicate. When data is redundantly recorded, sets of the same data maybe recorded at any position as long as the are at least one page apartfrom one another.

Next, the file (music program) combine process and divide process usingthe file management method according to the embodiment of FIGS. 4 to 24will be described.

Combine Process

Combine Process on FAT

In the combine process on the FAT, two files CAT.MSA and MAN.MSA ofthree files (music programs) CAT.MSA, DOG.MSA, and MAN.MSA are combined.

As shown in FIG. 34, when a user combines the two files into one file,the entry address at the end of the cluster management data on the FATcorresponding to the file CAT.MSA is changed from “FFF” to the startaddress “110” on the FAT corresponding to the file MAN.MSA (see alsoFIG. 6).

Thus, the combined file CAT.MSA uses the clusters 5, 6, 7, 8, 110, and111. In addition, the file name MAN.MSA is deleted from the subdirectory area. Moreover, the file name MAN.MSA managed with the cluster202 is deleted.

Editing Attribute Header

The editing method on the FAT for combining the two files CAT.MSA andMAN.MSA was described in the preceding section. Next, with reference toFIGS. 35A and 35B, the editing method of attribute headers of thereproduction management file PBLIST.MSF shown in FIG. 11 and the ATRAC3data file shown in FIG. 17 will be described.

FIG. 35A is a diagram showing a memory map of the two files CAT.MSA andMAN.MSA that have not been edited.

The memory map shown in FIG. 35A is in a state where logical addresseshave been converted into physical addresses. In addition, although partsare dispersed in memory 42, for simplicity, they are successivelyarranged. As shown in FIG. 35A, the attribute file of the file CAT.MSAcontains the number of the total sound units T-SU:100, the number oftotal parts T-PRT:3, a contents key, a MAC, a part size and a part keyfor each part, and a contents cumulation number CONNUM0.

Likewise, the attribute file of the file MAN.MSA contains the number oftotal sound-units T-SU:70, the number of total parts T-PRT:2, a contentskey, a MAC a part size and a part key for each part, and a contentscumulation number CONNUM0.

The data of the attribute file of the file CAT.MSA is updated asfollows.

When music programs are combined, the number of parts of a single fileincreases. Thus, the T-PRT contained in the attribute file is edited. Inaddition, since files are combined, the number of total sound unitsincreases. Thus, the T-SU is edited.

In other words, as shown in FIG. 35B, the value of the T-SU is rewrittento 170, which is the number of total sound units T-SU:100 of the fileCAT.MSA added to the number of total sound units T-SU:70 of the fileMAN.MSA. In addition, the value of the T-PRT is rewritten to 5, which isthe number of total parts T-PRT:3 of the file CAT.MSA added to thenumber of total parts T-PRT:2 of the file MAN.MSA.

In addition, when ATRAC3 data files (music programs) are combined, thecontents keys contained in the attribute files are newly created.Moreover, the MAC that is a forged copyright information check value ischanged.

Furthermore, the part information (see FIG. 22) contained in theattribute file block of the combined file MAN.MSA file is changed(copied) to the attribute file block of the file CAT.MSA. In addition,the part key PRTKEY of each part contained in the attribute file blockof which the part information has been added is re-encrypted with a newcontents key.

As shown in FIG. 9, since an attribute file is added to the headerportion of an ATRAC3 data file, if two ATRAC3 data files are simplycombined, the attribute file block of the file CAT.MSA, a plurality ofATRAC3 data blocks of the file CAT.MSA, the attribute file block of thefile MAN.MSA, and a plurality of ATRAC3 data blocks of the file MAN.MSAare successively combined. Thus, one combination file has two attributefiles.

To address this problem, according to the present invention, when thecombine process as shown in FIG. 35B is performed, the attribute file ofthe backward-side data file (in the illustrative embodiment, the fileMAN.MSA) is incorporated into the attribute file of the forward-sidedata file (CAT.MSA) and deleted.

Thus, the attribute file block of the file CAT.MSA, the plurality ofATRAC3 data blocks of the file CAT.MSA, and the plurality of ATRAC3 datablock of the file MAN.MSA are successively arranged.

Editing Reproduction Management File

In addition, with respect to the reproduction management file PBLISTshown in FIG. 11, since data files are combined, the number of totaltrack numbers decreases by one. Thus, the T-TRKs are edited so that theyare moved in the direction of TRK-001 without space.

Steps of Combine Process

FIG. 36 is a flow chart showing the file combine process. At step SP201,the user selects two files to be combined in a predetermined manner. Inthe illustrative embodiment, the user selects the files CAT.MSA andMAN.MSA. At step SP202, the link state on the FAT is edited. At stepSP203, the file name that is linked in the backward direction is deletedfrom the sub directory. At step SP204, the file name of the data filethat is combined in the backward direction is deleted from the dataarea. At step SP205, the attribute file of the forward-side ATRAC3 datafile is updated according to the attribute file of the backward-sideATRAC3. As described above, the number of total parts is edited. Inaddition, the number of total sound units T-SU is edited.

At step SP206, the attribute file of the backward-side ATRAC3 data fileis deleted. At step SP207, the T-TRK and the TRK-XXX of the reproductionmanagement file are edited.

Thus, the combine process is performed in the order of (1) editing theFAT, (2) editing the attribute file, and (3) editing the reproductionmanagement file. However, the order may be changed.

Divide Process

Next, a divide process for dividing one file at a particular positionwill be described.

Divide Process on FAT

FIG. 37 is a diagram showing a memory map for explaining a divideprocess on the file CAT.MSA from the files shown in FIG. 6.

It is assumed that the user performs the divide operation at theboundary of clusters 6 and 7 of the file CAT.MSA and that the divideprocess causes two files CAT1.MSA and CAT2.MSA to be generated.

First of all, the files DOG.MSA and MAN.MSA recorded at clusters 201 and202 are moved to clusters 202 and 203, respectively. In addition, thefile CAT1.MSA, which is an extension MSA added to the file name CAT1inputted by the user, is recorded to cluster 200. In addition, the filename CAT2.MSA, which is an extension MSA added to the file name CAT2inputted by the user, is recorded to cluster 201.

Next, the file name CAT.MSA that is recorded in the sub directory isrewritten to the file name CAT1.MSA. In addition, the file name CAT2.MSAis added to an unused slot.

At the end of the slot of the file CAT2.MSA, the cluster number “7” ofthe divided file CAT2.MSA is recorded.

The entry address is rewritten to “FFF” so that the end point of theslot of the file name CAT1.MSA of the sub directory on the FAT becomescluster 6. The divide process is performed on the FAT in theabove-described manner.

Editing Attribute Header

When a data file is divided, an attribute file should be generated sothat it is added to the divided file on the backward-side data file(i.e., CAT2.MSA).

Next, with reference to FIGS. 38A and 38B, this process will bedescribed.

FIGS. 38A and 38B show memory maps where logical addresses have beenconverted into physical addresses. In FIGS. 38A and 38B, for simplicity,individual parts are successively arranged in memory 42, not dispersed.As shown in FIG. 38A, the attribute file of the file CAT.MSA containsthe number of total sound units T-SU:170, the number of total partsT-PRT:5, a contents key, a MAC, a part size and a part key for eachpart, and a content cumulation number CONNUM0.

Now, it is assumed that the user designates a divide process at aparticular point of the file CAT.MSA. For example, it is assumed thatthe user performs a divide operation at the boundary between the parts 3and 4 shown in FIG. 38A. The data of the attribute file is updated inthe following manner.

As real update data, when a music program is divided, the number ofparts that compose a single file decreases. Thus, the T-PART containedin the attribute file is edited. In addition, when the file is divided,since the number of total sound units in the single file also decreases,the T-SU is also edited. In other words, as shown in FIG. 38B, thenumber of total sound units of the file CAT1.MSA that is divided on theforward side is rewritten to T-SU:100. In addition, the number of totalparts of the file CAT1.MSA is rewritten to T-PART:3.

In addition, since the file is divided, the contents key, the forgedcopyright information check value MAC, and the part key for each partare rewritten.

In addition, an attribute file of the file CAT2.MSA that is divided onthe backward side is newly created.

With respect to the attribute file that is newly created, the number oftotal sound units and the number of total parts are rewritten to T-SU:70and T-PART:2, respectively.

In addition, since the file is divided, the contents key, the forgedcopyright information check value MAC, and the part key for each partare rewritten.

Editing Reproduction Management File

Next, an editing method for the reproduction management file PBLIST in adivide process will be described. When a file is divided into two files,since the number of files increases by one, the number of total tracksT-TRK is increased by 1. In addition, the TRK-X table (where X is anyinteger in the range from 1 to 400) is edited so that the resultantmusic program numbers are shifted.

Steps of Divide Process

FIG. 39 is a flow chart showing a divide process.

At step SP301, when the user selects a file to be divided, whilelistening to music of the file, he or she selects a divide point in apredetermined manner. At step SP302, the link state of the FAT is editedin the above-described manner. At step SP303, the file name of the datafile that is divided on the backward side is added to the sub directory.At step SP304, the file name of the data file that is divided on theforward side is added to the data area. The file names are inputted bythe user. At step SP305, the attribute file of the data file on theforward side of the divide point is edited. In addition, at step SP306,the attribute file to be added to the backward-side data file isgenerated. The attribute file is newly created and the attribute file isedited corresponding to the divide point of the divided file. At stepSP307, the reproduction management file PBLIST is edited. Theabove-described divide process is performed in the order of (1) editingthe FAT, (2) editing the attribute file, and (3) editing thereproduction management file. However, the order may be changed.

The present invention enables a user to edit data files (ATRAC3 files)recorded in memory card 40. Next, edit processes (for example, combineprocess and divide process) corresponding to the track management fileTRKLIST described with reference to FIGS. 25 to 32 will be described indetail. However, the following description can be applied to the trackinformation area TRKINF and the part information area PRTINF of anATRAC3 data file.

In this section, with reference to FIG. 40, a combine process (see FIG.10B) for combining two tracks A and B composed of one part each will bedescribed. FIG. 40 is a flow chart showing the combine process. At step401, the part information area PRTINF of track B on the backward side ismoved below the part information area PRTINF of track A. Thus, in thetrack information management file TRKLIST, the track information areaTRKINF of track A, the part information area PRTINF of track A, the partinformation area PRTINF of track B, and the track information areaTRKINF of track B are successively arranged.

At step 402, the chain of the FAT of the ATRAC3 data file of track B islinked on the backward side of the chain of the FAT of the ATRAC3 datafile of track A. At step 403, the track information area TRKINF of trackB is deleted from the track information management file TRKLIST. Thus,in the track information management file TRKLIST, the track informationarea TRKINF of track A, the part information area PRTINF of the track A,and the part information area PRTINF of track B are successivelyarranged. At step 404, the ATRAC3 data file of track B is deleted fromthe directory. At step 405, P-nnn representing the number of parts thatcompose a music program in the track information area TRKINF of track Ais changed from 1 to 1+1=2.

Thus, the values of the keys are changed. In this example, the contentskey of the original track A is denoted by KC_A; and the contents key ofthe original track B is denoted by KC_B. Likewise, the part key of theoriginal track A is denoted by KP_A; and the part key of the originaltrack B is denoted by KP_B.

At step 406, after tracks A and B are combined, the contents key of thenew track N is generated as KC_N. The CONNUM is also newly generated. Atstep 407, a new part key is generated. The new part key is generatedwith an exclusive OR operation of the contents key KC_A, the part keyKP_A, and the contents key KC_N. At step 408, the backward-side part key(namely, the part key for the part information area PRTINF of theoriginal track B) is generated. Similar to the new part key, thebackward-side part key is generated with an exclusive OR operation ofthe contents key KC_B, the part key KP_B, and the contents key KC_N.

At step 409, the contents key KC_N of the new track N is encrypted withthe storage key of memory card 40 and stored in the CONTENTS KEY-nnn ofthe track information area TRKINF. The CONNUM is stored in theCONNUM-nnn of the track information area TRKINF. In addition, each partkey is stored in the PRTKEY-nnn of the part information area PRTINF.

Next, with reference to FIG. 41, the divide process (see FIG. 10C) fordividing a track A composed of one part into two tracks A and B will bedescribed. FIG. 41 is a flow chart showing the divide process. At step501, the divide point is decided at an SU. At step 502, the PRTSIZE ofthe part information area PRTINF of the new track A is changed. Inreality, the number of clusters from the beginning (start SU) to thedivide point (end SU) is counted. The cluster size, the start SU, andthe end SU are changed corresponding to the position of the divide pointof the cluster and stored to the PRTSIZE of the part information area ofthe new track A.

At step 503, one cluster that is the last cluster of the new track Athat contains the divide point is completely copied. The copied clusteris treated as the top part of the new track B. At step 504, the numberof total parts of the newly generated track B is stored to the P-nnnrepresenting the number of parts that compose a music program in thetrack information area TRKINF of track B. In this example, clusterspreceded by the divide point become the second part, which is the newlygenerated track B. The number of total parts of the newly generatedtrack B is counted. At step 505, the file number FNW-nnn of the newATRAC3 data file is generated and stored to the FNW-nnn of the trackinformation area TRKINF.

At step 506, the track information area TRKINF of the new track B andthe part information area PRTINF are added on the backward side of thepart information area PRTINF of the new track A of the track informationmanagement file TRKLIST. The track information area TRKINF of the trackon the backward side of the original track A and the part informationarea PRTINF are moved backward by the track information area TRKINF andthe part information area PRTINF of track B.

At step 507, the chain of the FAT of the ATRAC3 data file of the newtrack A is changed to the divide point. At step 508, since track B isnewly added, file B of the ATRAC3 data file is added to the directory.At step 509, the chain of the FAT of the ATRAC3 data file of the newlygenerated track B is followed by the remaining portion of the originaltrack A (namely, the chain of the clusters including the divide point).

Since the new track B is added, the key values are added. However, thekey values of the new track A are not changed.

At step 510, after the track is divided, the contents key KC_B of thenew track B is generated. In addition, the CONNUM is newly generated. Atstep 511, the part key KP_B of the new track B is generated. The partkey of the new track B is generated with an exclusive OR operation ofthe original KC_A, KP_A, and KC_B.

At step 512, the contents key KC_B of the new track B is encrypted withthe storage key of memory card 40 and stored to the CONTENTS KEY-nnn ofthe track information area TRKINF. In addition, the CONNUM is stored tothe CONNUM-nnn of the track information area TRKINF. Each part key isdirectly stored to the PRTKEY-nnn of the part information area PRTINF.

Thus, even if edit processes such as combine and divide processes areperformed, the track information area TRKINF and the part informationarea PRTINF are arranged in the same order of ATRAC3 data files. Inother words, unlike the Link-P system, the track information area TRKINFof one file that has been edited and the link destination of the partinformation area PRTINF are arranged successively, not randomly.

In addition, when another edit process such as an erase process or amove process is performed, the track information area TRKINF and thepart information area PRTINF are re-arranged in the same order as ATRAC3data files.

According to the present invention, even if the FAT of flash memory 42is destroyed, an attribute file is added at the beginning of each fileso as to manage parts that may be dispersed in the memory using theattribute file. Thus, the editing process is properly performed. Inaddition, the editing process can be properly performed for a recordingmedium such as a flash memory in which block defects tend to take place.

It will thus be seen that the objects set forth above, among those madeapparent from the preceding description, are efficiently attained and,because certain changes may be made in carrying out the above method(s)and in the construction(s) set forth without departing from the spiritand scope of the invention, it is intended that all matter contained inthe above description and shown in the accompanying drawings shall beinterpreted as illustrative and not in a limiting sense.

1-24. (canceled)
 25. An editing apparatus for editing a data filerecorded in a nonvolatile memory for segmenting a single data file thatis successively reproduced to blocks each having a predetermined datalength, the nonvolatile memory having a data area for recording eachblock along with an attribute file having a predetermined length and amanagement area for recording management data for managing a data filerecorded in the data area, the editing apparatus comprising: operatingmeans for selecting two data files recorded in the data area so as toperform a combine process for the selected two data files; separatingmeans for separating an attribute file from a backward side data file ofthe selected two data files; editing means for editing the managementdata recorded in the management area so that the two data files arelogically linked and editing an attribute file added to a forward sidedata file of the selected two data files; recording means for recordingthe management data edited by said editing means to the management areaand recording the attribute file added to the forward side data file tothe data area; and encoder/decoder means for encoding and input signaland thereby generating an encoded signal.